Author:
Xue Ping,Chen Shaozhen,Fu Zhixin
Abstract
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.
Subject
General Physics and Astronomy
Reference23 articles.
1. Cryptography: Theory and practice;Stinson;IEEE Transactions on Medical Imaging,2007
2. Discrete logarithms in GF (p)[J];Coppersmith;Algorithmica,1986
3. On Polynomial Selection for the General Number Field Sieve[J];Kleinjung;Mathematics of Computation,2006