Refined analysis and improvements on some factoring algorithms☆
References (27)
On the number of positive integers ⩽ x and free of prime factors >y
Indag. Math.
(1951)Theorie des Nombres
(1798)- et al.
A method for obtaining digital signatures and public key cryptosystems
Comm. ACM
(1978) - et al.
A method of factorization and the factorization of F7
Math. Comput.
(1975) Class number, a theory of factorization and genera
On factorization, with a suggested new approach
Math. Comput.
(1975)Asymptotical fast factorization of integers
Math. Comp.
(1981)Algorithmes de factorisation d'entiers
A Monte Carlo method for factorization
BIT
(1975)How to factor a number
On the number of positive integers ⩽ x and free of prime factors > y, II
Theorems on factorization and primality testing
Cited by (11)
On the distribution in short intervals of integers having no large prime factor
1987, Journal of Number TheoryVáclav Šimerka: Quadratic forms and factorization
2013, LMS Journal of Computation and MathematicsFaster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation
2022, Journal of Cryptographic EngineeringRational Number Theory in the 20th Century From PNT to FLT
2012, Springer Monographs in MathematicsModern computer algebra: Third edition
2011, Modern Computer Algebra: Third Edition
- ☆
This work started in summer 1980 during a stay at the Stanford Computer Science Department. Preparation of this report was supported in part by National Science Foundation grant MCS-77-23738, and by the Bundesminister für Forschung und Technologie, Federal Republic of Germany, Grant 083 0108.
Copyright © 1982 Published by Elsevier Inc.