You are looking at a specific version 20040417:042934 of this paper.
See the latest version.
Paper 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.