Cryptology ePrint Archive: Report 2004/095

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

Kazumaro Aoki and Yuji Kida and Takeshi Shimoyama and Hiroki Ueda

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.

Category / Keywords: implementation / factoring, RSA-100, RSA-110, RSA-120, RSA-130, RSA-140, RSA-150

Date: received 15 Apr 2004

Contact author: maro at isl ntt co jp

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040417:042934 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]