Advertisement

Factoring with two large primes

Extended Abstract
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 473)

Abstract

The study of integer factoring algorithms and the design of faster factoring algorithms is a subject of great importance in cryptology (cf. [1]), and a constant concern for cryptographers. In this paper we present a new technique that proved to be extremely useful, not only to achieve a considerable speed-up of an older and widely studied factoring algorithm, but also, and more importantly, to make practical application of a new factoring algorithm feasible. While this first application does not pose serious threats to factorization-based cryptosystems, the consequences of the second application could be very encouraging (from the cryptanalysts point of view).

References

  1. 1.
    G. Brassard, Modern Cryptology, Lecture Notes in Computer Science, vol. 325, 1988, Springer-Verlag.zbMATHGoogle Scholar
  2. 2.
    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, Amer. Math. Soc., Providence, Rhode Island 1988.Google Scholar
  3. 3.
    W. Bosma, M.-P. van der Hulst, A.K. Lenstra, “An improved version of the Jacobi sum primality test,” in preparation.Google Scholar
  4. 4.
    J. Buhler, H.W. Lenstra, Jr., C. Pomerance, in preparation.Google Scholar
  5. 5.
    H. Cohen, A.K. Lenstra, “Implementation of a new primality test,” Math. Comp., v. 48, 1987, pp. 103–121.MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, J.M. Pollard, “The number field sieve,” to appear.Google Scholar
  8. 8.
    A.K. Lenstra, M.S. Manasse, “Factoring by electronic mail,” Proceedings Eurocrypt’ 89.Google Scholar
  9. 9.
    H. W. Lenstra, Jr., personal communication.Google Scholar
  10. 10.
    F. Morain, “Primality testing: News from the front,” Proceedings Eurocrypt’ 89.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    R. D. Silverman, “The multiple polynomial quadratic sieve,” Math. Comp., v. 48, 1987, pp. 329–339.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Bell Communications ResearchMorristown
  2. 2.Digital Equipment CorporationSystems Research CenterPalo Alto

Personalised recommendations