Collecting relations for the number field sieve in GF(p^6)

DOI10.1112/S1461157016000164MaRDI QIDQ2971019zbMATH OpenOpenAlexFDO

Authors Pierrick Gaudry, Laurent Grémy, Marion Videau

Publication date 4 April 2017

Published in LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s1461157016000164

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to number theory (11-04)

Recommendations

• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)

Cites work

• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A taxonomy of pairing-friendly elliptic curves
• Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms and local units
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• On polynomial selection for the general number field sieve
• Root optimization of polynomials in the number field sieve
• The Number Field Sieve in the Medium Prime Case
• The multiple number field sieve for medium- and high-characteristic finite fields
• The tower number field sieve
• Virtual logarithms

Cited in

(9)

• A brief history of pairings
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
• Updating key size estimations for pairings
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Lattice sieving in three dimensions for discrete log in medium characteristic
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
• Higher-dimensional sieving for the number field sieve algorithms
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
• Computing discrete logarithms in \(\mathbb F_{p^6}\)

This page was built for publication: Collecting relations for the number field sieve in \(\text{GF}(p^6)\)

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