arXiv · 1103.1493
An Improvement to the Number Field Sieve
Abstract
We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is less than two-thirds of the running time of the algorithm used before asymptotically with probability gr
Explore related subjects
Keep this discovery
Qizhi Zhang. 2011-03-08. An Improvement to the Number Field Sieve. https://arxiv.org/abs/1103.1493
Cite the original work for its findings. Save a collection to share your selection of sources.