Abstract
Since Crypto 83 we have had considerably more experience in factoring large integers. Implementation of various modifications to the quadratic sieve algorith have enabled the factorization of hard 70-digit numbers in times comparable to 50 digits one year ago. These modifications include:
-
1)
Subsequences with large divisors (Special q’s).
-
2)
Multipliers to improve quadratic properties.
-
3)
Increased size of prime base using segmented Gaussian Elimination.
-
4)
Optimization of the code with respect to Cray hardware. Using this code in its various stages of development the 10 most wanted numbers from the Cunningham Project have been factored. Details will be published elsewhere.
This work was performed at Sandia National Laboratories supported by the U. S. Department of Energy under Contract No. DE-ACOY-76DP00789.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davis, J.A., Holdridge, D.B. (1985). An Update on Factorization at Sandia National Laboratories. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive