5 research outputs found
Faster Initial Splitting for Small Characteristic Composite Extension Degree Fields
Let be a small prime and be a composite integer.
For the function field sieve algorithm applied to , Guillevic (2019) had proposed an algorithm for initial
splitting of the target in the individual logarithm phase. This algorithm generates polynomials and tests them for -smoothness
for some appropriate value of . The amortised cost of generating each polynomial is multiplications over .
In this work, we propose a new algorithm for performing the initial splitting which also generates and tests polynomials
for -smoothness. The advantage over Guillevic splitting is that in the new algorithm, the cost of generating a polynomial
is multiplications in , where is the relevant smoothness probability
Computing Individual Discrete Logarithms Faster in
The Number Field Sieve (NFS) algorithm is the best known method to
compute discrete logarithms (DL) in finite fields
, with medium to large and small. This algorithm
comprises four steps: polynomial selection, relation collection,
linear algebra and finally, individual logarithm computation. The
first step outputs two polynomials defining two number fields, and a
map from the polynomial ring over the integers modulo each of these
polynomials to .
After the relation collection and linear algebra
phases, the (virtual) logarithm of a subset of elements in each number
field is known. Given the target element in , the fourth
step computes a preimage in one number field. If one can write the
target preimage as a product of elements of known (virtual) logarithm,
then one can deduce the discrete logarithm of the target.
As recently shown by the Logjam attack, this final step can be
critical when it can be computed very quickly.
But we realized that computing an individual DL is much slower in medium-
and large-characteristic non-prime fields with ,
compared to prime fields and quadratic fields . We optimize
the first part of individual DL: the \emph{booting step}, by reducing
dramatically the size of the preimage norm.
Its smoothness probability is higher, hence the running-time of the
booting step is much improved.
Our method is very efficient for small extension fields with and applies to any , in medium and large characteristic
Computing Individual Discrete Logarithms Faster in GF with the NFS-DL Algorithm
International audienceThe Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields , with medium to large and small. This algorithm comprises four steps: polynomial selection, relation collection, linear algebra and finally, individual logarithm computation. The first step outputs two polynomials defining two number fields, and a map from the polynomial ring over the integers modulo each of these polynomials to . After the relation collection and linear algebra phases, the (virtual) logarithm of a subset of elements in each number field is known. Given the target element in , the fourth step computes a preimage in one number field. If one can write the target preimage as a product of elements of known (virtual) logarithm, then one can deduce the discrete logarithm of the target. As recently shown by the Logjam attack, this final step can be critical when it can be computed very quickly. But we realized that computing an individual DL is much slower in medium-and large-characteristic non-prime fields with , compared to prime fields and quadratic fields . We optimize the first part of individual DL: the \emph{booting step}, by reducing dramatically the size of the preimage norm. Its smoothness probability is higher, hence the running-time of the booting step is much improved. Our method is very efficient for small extension fields with and applies to any , in medium and large characteristic
Faster individual discrete logarithms in finite fields of composite extension degree
International audienceComputing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}, {GF}) are the Number Field Sieve and its variants (special, high-degree, tower). The best algorithms in small characteristic finite fields (e.g., {GF}) are the Function Field Sieve, Joux's algorithm, and the quasipolynomial-time algorithm. The last step of this family of algorithms is the individual logarithm computation. It computes a smooth decomposition of a given target in two phases: an initial splitting, then a descent tree. While new improvements have been made to reduce the complexity of the dominating relation collection and linear algebra steps, resulting in a smaller factor basis (database of known logarithms of small elements), the last step remains at the same level of difficulty. Indeed, we have to find a smooth decomposition of a typically large element in the finite field. This work improves the initial splitting phase and applies to any nonprime finite field. It is very efficient when the extension degree is composite. It exploits the proper subfields, resulting in a much more smooth decomposition of the target. This leads to a new trade-off between the initial splitting step and the descent step in small characteristic. Moreover it reduces the width and the height of the subsequent descent tree