International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Hiroki Ueda

Publications

Year
Venue
Title
2004
ASIACRYPT
2004
EPRINT
GNFS Factoring Statistics of RSA-100, 110, ..., 150
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.

Coauthors

Kazumaro Aoki (2)
Yuji Kida (1)
Takeshi Shimoyama (1)