Abstract
Since the cryptosecurity of the RSA two key cryptoalgorithm is no greater than the difficulty of factoring the modulus (product of two secret primes), a code that implements the Quadratic Sieve factorization algorithm on the CRAY I computer has been developed at the Sandia National Laboratories to determine as sharply as possible the current state-of-the-art in factoring. Because all viable attacks on RSA thus far proposed are equivalent to factorization of the modulus, sharper bounds on the computational difficulty of factoring permit improved estimates for the size of RSA parameters needed for given levels of cryptosecurity.
Analysis of the Quadratic Sieve indicates that it may be faster than any previously published general purpose algorithm for factoring large integers. The high speed of the CRAY I coupled with the capability of the CRAY to pipeline certain vectorized operations make this algorithm (and code) the front runner in current factoring techniques.
This work performed at Sandia National Laboratories supported by the U. S. Department of Energy under contract number DE-AC04-76DP00789.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman, S. S. Wagstaff, Jr., Factorizations of b n ±1 up to High Powers, American Math. Soc., 1983.
D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc., Boston, Mass., 1976.
D. E. Knuth, The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms, 2nd Edition, AddisonWesley, Reading, Mass., 1981.
W. J. LeVeque, Studies in Number Theory, MAA Studies in Mathematics, Vol. 6, 1969.
M. A. Morrison, J. Brillhart, “A method of factoring and the factorization of F7,” Math. Comp. 29, 1975, 183–205.
D. Parkinson, M. C. Wunderlich, “A memory efficient algorithm for Gaussian elimination over GF(2) on parallel computers,” in preparation.
C. Pomerance, “Analysis and comparison of some integer factoring algorithms,” Number Theory and Computers (H. W. Lenstra, Jr., and R. Tijdeman, eds.) Math. Centrum Tracts, Number 154, Part I.
C. Pomerance, Personal communication, May 26, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Davis, J.A., Holdridge, D.B. (1984). Factorization Using the Quadratic Sieve Algorithm. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4730-9_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4732-3
Online ISBN: 978-1-4684-4730-9
eBook Packages: Springer Book Archive