• Johannes A. Buchmann
Part of the Undergraduate Texts in Mathematics book series (UTM)


We have seen that the security of the RSA system and the Rabin system is closely connected to the difficulty of factoring a positive integer into primes. But it is not known whether the integer factoring problem is in fact difficult to solve. On the contrary, over the years many efficient integer factoring algorithms have been invented, and the number of digits required for secure RSA moduli has been increased from 512 to 1024 bits.


Prime Number Factor Base Factoring Algorithm Proper Divisor Integer Factoring Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Johannes A. Buchmann
    • 1
  1. 1.Department of Computer ScienceTechnical UniversityDarmstadtGermany

Personalised recommendations