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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
