2000 character limit reached
An Improvement to the Number Field Sieve
Published 8 Mar 2011 in math.NT and cs.CC | (1103.1493v1)
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
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.