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

Kazumaro Aoki; Yuji Kida; Takeshi Shimoyama; Hiroki Ueda

Paper 2004/095 Original: eprint.iacr.org/2004/095 ↗

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

Kazumaro Aoki

Yuji Kida

Takeshi Shimoyama

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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
History: 2004-04-17: last updated; 2004-04-17: published
Short URL: https://ia.cr/2004/095
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/095,
      author = {Kazumaro Aoki and Yuji Kida and Takeshi Shimoyama and Hiroki Ueda},
      title = {GNFS Factoring Statistics of RSA-100, 110, ..., 150},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/095},
      year = {2004},
      url = {https://eprint.iacr.org/2004/095}
}