International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: GNFS Factoring Statistics of RSA-100, 110, ..., 150

Authors:
Kazumaro Aoki
Yuji Kida
Takeshi Shimoyama
Hiroki Ueda
Download:
URL: http://eprint.iacr.org/2004/095
Search ePrint
Search Google
Abstract: GNFS (general number field sieve) algorithm is currently the fastest known algorithm for factoring large integers. Up to the present, several running time estimates for GNFS are announced. These estimates are usually based on the previous factoring results. However, since the previous factoring results were done by various programs and/or computers, it is difficult to compare those running time. We implemented GNFS and factored 100- to 150-digits number on the same environment. This manuscript describes the statistics of these factorings.
BibTeX
@misc{eprint-2004-12068,
  title={GNFS Factoring Statistics of RSA-100, 110, ..., 150},
  booktitle={IACR Eprint archive},
  keywords={implementation / factoring, RSA-100, RSA-110, RSA-120, RSA-130, RSA-140, RSA-150},
  url={http://eprint.iacr.org/2004/095},
  note={ maro@isl.ntt.co.jp 12524 received 15 Apr 2004},
  author={Kazumaro Aoki and Yuji Kida and Takeshi Shimoyama and Hiroki Ueda},
  year=2004
}