Refined analysis and improvements on some factoring algorithms
- 30 June 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (2) , 101-127
- https://doi.org/10.1016/0196-6774(82)90012-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Asymptotically fast factorization of integersMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- On factorisation, with a suggested new approachMathematics of Computation, 1975
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975
- An algorithm for division of powerseriesComputing, 1972
- Schnelle Multiplikation großer ZahlenComputing, 1971
- On The Number of Positive Integers ≤ x and Free of Prime Factors > yIndagationes Mathematicae, 1951