Factoring by electronic mail
 Arjen K. Lenstra,
 Mark S. Manasse
 … show all 2 hide
Abstract
In this paper we describe our distributed implementation of two factoring algorithms, the elliptic curve method (ecm) and the multiple polynomial quadratic sieve algorithm (mpqs).
Since the summer of 1987, our ecmimplementation on a network of MicroVAX processors at DEC’s Systems Research Center has factored several most and more wanted numbers from the Cunningham project. In the summer of 1988, we implemented the multiple polynomial quadratic sieve algorithm on the same network. On this network alone, we are now able to factor any 100 digit integer, or to find 35 digit factors of numbers up to 150 digits long within one month.
To allow an even wider distribution of our programs we made use of electronic mail networks for the distribution of the programs and for interprocessor communication. Even during the initial stage of this experiment, machines all over the United States and at various places in Europe and Australia contributed 15 percent of the total factorization effort.
At all the sites where our program is running we only use cycles that would otherwise have been idle. This shows that the enormous computational task of factoring 100 digit integers with the current algorithms can be completed almost for free. Since we use a negligible fraction of the idle cycles of all the machines on the worldwide electronic mail networks, we could factor 100 digit integers within a few days with a little more help.
 L. Adleman, “The theory of computer viruses,” Proceedings Crypto 88, 1988.
 E. Bach. J. Shallit. “Factoring with cyclotomic polynomials,” Proceedings 26th FOCS, 1985, pp 443–450.
 G. Brassard, Modern Cryptology, Lecture Notes in Computer Science, vol. 325, 1988, Springer Verlag.
 R.P. Brent, “Some integer factorization algorithms using elliptic curves,” Australian Computer Science Communications v. 8, 1986, pp 149–163.
 R.P. Brent, G.L. Cohen, “A new lower bound for odd perfect numbers,” Math. Comp., to appear.
 J. Brillhart, D.H. Lehmer, J.L. Selfridge, B. Tuckerman, S.S. Wagstaff, Jr., Factorizations of b ^{n} ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, second edition, Contemporary Mathematics, vol. 22, Providence: A.M.S., 1988.
 T.R. Caron, R.D. Silverman, “Parallel implementation of the quadratic sieve,” J. Supercomputing, v. 1, 1988, pp 273–290. CrossRef
 A.J.C. Cunningham, H.J. Woodall, Factorisation of (y ^{n} ∓1). y = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers (n), London: Hodgson (1925).
 J.A. Davis, D.B. Holdridge. “Factorization using the quadratic sieve algorithm,” Sandia National Laboratories Tech Rpt. SAND 831346, December 1983.
 P.J. Denning, “The Science of Computing: Computer Viruses,” American Scientist, v. 76, May–June 1988.
 A.K. Lenstra, H.W. Lenstra, Jr, “Algorithms in number theory,” in: J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, D. Perrin (eds.), Handbook of theoretical computer science, to appear; report 878, The University of Chicago, Department of Computer Science, May 1987.
 A.K. Lenstra, M.S. Manasse, “Compact incremental Gaussian elimination over Z/2Z,” report 8816, The University of Chicago, Department of Computer Science, October 1988.
 H.W. Lenstra, Jr., “Factoring integers with elliptic curves,” Ann. of Math., v. 126, 1987, pp. 649–673. CrossRef
 P.L. Montgomery, “Modular multiplication without trial division,” Math. Comp., v. 44, 1985, pp 519–521. CrossRef
 P.L. Montgomery, “Speeding the Pollard and elliptic curve methods of factorization,” Math. Comp., v. 48, 1987, pp 243–264. CrossRef
 P.L. Montgomery, R.D. Silverman, “An FFT extension to the p1 factoring algorithm,” manuscript, 1988.
 A.M. Odlyzko, “Discrete logarithms and their cryptographic significance,” pp. 224–314; in: T. Beth, N. Cot, I. Ingemarsson (eds), Advances in cryptology, Springer Lecture Notes in Computer Science, vol. 209, 1985. CrossRef
 J.M. Pollard, “A Monte Carlo method for factorization,” BIT, v. 15, 1975, pp 331–334. CrossRef
 C. Pomerance, “Analysis and comparison of some integer factoring algorithms,” pp. 89–139; in: H.W. Lenstra, Jr., R. Tijdeman (eds), Computational methods in number theory, Mathematical Centre Tracts 154, 155, Mathematisch Centrum, Amsterdam, 1982.
 C. Pomerance, J.W. Smith, R. Tuler, “A pipeline architecture for factoring large integers with the quadratic sieve algorithm,” SIAM J. Comput., v. 17, 1988, pp. 387–403. CrossRef
 H.J.J. te Riele, W.M. Lioen, D.T. Winter, “Factoring with the quadratic sieve on large vector computers,” report NMR8805, 1988, Centrum voor Wiskunde en Informatica, Amsterdam.
 R.L. Rivest, A. Shamir, L. Adleman, “A method for obtaining digital signatures and publickey cryptosystems,” Commun. ACM., v. 21, 1978, pp. 120–126. CrossRef
 E. Roberts, J. Ellis, “parmake and dp: Experience with a distributed, parallel implementation of make,” Proceedings from the Second Workshop on LargeGrained Parallelism, Software Engineering Institute, CarnegieMellon University, Report CMU/SEI87SR5, November 1987.
 R.D. Silverman, “The multiple polynomial quadratic sieve,” Math. Comp., v. 48, 1987, pp. 329–339. CrossRef
 K. Thompson, “Reflections on Trusting Trust,” Commun. ACM, v. 27, 1984, pp. 172–80. CrossRef
 D.H. Wiedemann, “Solving sparse linear equations over finite fields,” IEEE Transactions on Information Theory, v. 32, 1986, pp. 54–62. CrossRef
 Title
 Factoring by electronic mail
 Book Title
 Advances in Cryptology — EUROCRYPT ’89
 Book Subtitle
 Workshop on the Theory and Application of Cryptographic Techniques Houthalen, Belgium, April 10–13, 1989 Proceedings
 Book Part
 Section 6
 Pages
 pp 355371
 Copyright
 1990
 DOI
 10.1007/3540468854_35
 Print ISBN
 9783540534334
 Online ISBN
 9783540468851
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 434
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 JeanJacques Quisquater ^{(1)}
 Joos Vandewalle ^{(2)}
 Editor Affiliations

 1. Philips Research Laboratory
 2. ESAT Laboratory, Katholieke Universiteit Leuven
 Authors

 Arjen K. Lenstra ^{(3)}
 Mark S. Manasse ^{(4)}
 Author Affiliations

 3. Department of Computer Science, The University of Chicago, 1100 E 58th Street, Chicago, IL, 60637
 4. DEC Systems Research Center, 130 Lytton Avenue, Palo Alto, CA, 94301
Continue reading...
To view the rest of this content please follow the download PDF link above.