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

DOI10.1112/S1461157016000164zbMATH Open1391.11161OpenAlexW2560395997MaRDI QIDQ2971019FDOQ2971019

Laurent Grémy, Marion Videau, Pierrick Gaudry

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

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)\)

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)

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• 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
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• The Number Field Sieve in the Medium Prime Case
• Discrete logarithms and local units
• The Tower Number Field Sieve
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• Virtual logarithms
• The multiple number field sieve for medium- and high-characteristic finite fields

Cited In (7)

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

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)