Welcome to the resource topic for 2004/095
Title:
GNFS Factoring Statistics of RSA-100, 110, …, 150
Authors: 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.
ePrint: https://eprint.iacr.org/2004/095
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .