z-logo
open-access-imgOpen Access
The Lattice Sieve Field Selection of Cado-NFS
Author(s) -
Ping Xue,
Shaozhen Chen,
Zhixin Fu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1453/1/012036
Subject(s) - sieve (category theory) , lattice (music) , logarithm , selection (genetic algorithm) , software , computer science , algorithm , mathematics , physics , discrete mathematics , artificial intelligence , mathematical analysis , acoustics , programming language
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here