Computing Individual Discrete Logarithms Faster in {{\mathrm{GF}}}(p^n) with the NFS-DL Algorithm

DOI10.1007/978-3-662-48797-6_7zbMATH Open1396.11141arXiv1505.07553OpenAlexW1950331499MaRDI QIDQ2811129FDOQ2811129

Aurore Guillevic

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Abstract: The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $mathbb{F}_{p^n}$, with $p$ medium to large and $ngeq1$ 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 $mathbb{F}_{p^n}$. 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 $mathbb{F}_{p^n}$, 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 $mathbb{F}_{p^n}$ with $ngeq3$, compared to prime fields and quadratic fields $mathbb{F}_{p^2}$. 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 $2leqnleq6$ and applies to any $nextgreater1$, in medium and large characteristic.

Full work available at URL: https://arxiv.org/abs/1505.07553

zbMATH Keywords

discrete logarithmfinite fieldnumber field sieveindividual logarithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cited In (9)

• Collecting relations for the number field sieve in
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Higher-dimensional sieving for the number field sieve algorithms
• Faster individual discrete logarithms in finite fields of composite extension degree
• Lattice sieving in three dimensions for discrete log in medium characteristic
• Individual discrete logarithm with sublattice reduction
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Faster initial splitting for small characteristic composite extension degree fields
• Refined analysis to the extended tower number field sieve

This page was built for publication: Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811129)