Computing discrete logarithms in \(\mathbb F_{p^6}\)

DOI10.1007/978-3-319-72565-9_5zbMath1384.94066OpenAlexW2781216073MaRDI QIDQ1746956

Emmanuel Thomé, François Morain, Aurore Guillevic, Laurent Grémy

Publication date: 26 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_5

Mathematics Subject Classification ID

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

Related Items (6)

Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Updating key size estimations for pairings ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic

Cites Work

• Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
• Bounds for resultants of univariate and bivariate polynomials
• Modifications to the number field sieve
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Updating key size estimations for pairings
• A taxonomy of pairing-friendly elliptic curves
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• An Implementation of the Number Field Sieve
• The Tower Number Field Sieve
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• The multiple number field sieve for medium- and high-characteristic finite fields
• Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Collecting relations for the number field sieve in
• Discrete logarithms and local units
• Special Units in Real Cyclic Sextic Fields
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• On asymptotic complexity of computing discrete logarithms over GF(p)
• Using number fields to compute logarithms in finite fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Advances in Cryptology - CRYPTO 2003
• On the Discrete Logarithm Problem on Algebraic Tori
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• The Number Field Sieve in the Medium Prime Case
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing discrete logarithms in \(\mathbb F_{p^6}\)