The integer factoring problem is one of the oldest and important problems and it is considered as hard, i.e., the problem cannot be solved in polynomial time for the worst case, because the security of RSA is heavily dependent on the difficulties of integer factoring. As is well known, hardware technology is progressing rapidly from year to year and it seems that the time is now ripe to factor 1024- bit integers. Recently, there have been many studies that have investigated the possibility of 1024-bit integer factoring.


Operating System Communication Network Source Code Polynomial Time Promising Candidate 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kazumaro Aoki
    • 1
  1. 1.NTTKanagawa-kenJapan

Personalised recommendations