Abstract
The software application of the discrete logarithms on the “large” finite field is studied. The most effective algorithm for the problem is the general number field sieve (GNFS). Focusing on the theory of GNFS of solving software Cado-NFS and lattice sieves, we find the selection of lattice sieve which improve efficiency of CADO-NFS. This is the first parameter modification suggest. The efficiency of our selection is better than the current by experiment.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
