论文信息 - (Short Paper) Parameter Trade-Offs for NFS and ECM

(Short Paper) Parameter Trade-Offs for NFS and ECM

This paper analyzes two factoring algorithms, NFS (Number Field Sieve) and ECM (Elliptic Curve Method). The previous results only minimize their running times, however, we may need to minimize the storage size or running time with smaller success probability. We provide these trade-offs, L[s] (\(s\le 1/3\)) memory requires \(L[1-2s]\) running time for NFS, for example. This can be interpreted that NFS requires much more running time when reducing memory complexity.

Kazumaro Aoki

[1] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .

[2] Kazumaro Aoki,et al. Sieving Using Bucket Sort , 2004, ASIACRYPT.

[3] Thorsten Kleinjung,et al. On polynomial selection for the general number field sieve , 2006, Math. Comput..

[4] D. Coppersmith. Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm , 1994 .

[5] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[6] Don Coppersmith. Modifications to the Number Field Sieve , 2004, Journal of Cryptology.

[7] A. K. Lenstra,et al. The Development of the Number Field Sieve , 1993 .

[8] Arjen K. Lenstra,et al. A Kilobit Special Number Field Sieve Factorization , 2007, ASIACRYPT.

[9] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.