Computing discrete logarithms in F_p^6
From MaRDI portal
Publication:1746956
DOI10.1007/978-3-319-72565-9_5zbMATH Open1384.94066OpenAlexW2781216073MaRDI QIDQ1746956FDOQ1746956
Authors: Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé 
Publication date: 26 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_5
Recommendations
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- scientific article; zbMATH DE number 2081061
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
- Title not available (Why is that?)
- Bounds for resultants of univariate and bivariate polynomials
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Special Units in Real Cyclic Sextic Fields
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Title not available (Why is that?)
- An Implementation of the Number Field Sieve
- Modifications to the number field sieve
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- On the Discrete Logarithm Problem on Algebraic Tori
- Updating key size estimations for pairings
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- The Number Field Sieve in the Medium Prime Case
- Using number fields to compute logarithms in finite fields
- Discrete logarithms and local units
- On asymptotic complexity of computing discrete logarithms over GF(p)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- The Tower Number Field Sieve
- Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
- Collecting relations for the number field sieve in
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
- The multiple number field sieve for medium- and high-characteristic finite fields
- The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
- A Kilobit Hidden SNFS Discrete Logarithm Computation
Cited In (8)
- On the Complexity of Computing Discrete Logarithms over Algebraic Tori
- Updating key size estimations for pairings
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Higher-dimensional sieving for the number field sieve algorithms
- Title not available (Why is that?)
- Faster individual discrete logarithms in finite fields of composite extension degree
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
- Lattice sieving in three dimensions for discrete log in medium characteristic
This page was built for publication: Computing discrete logarithms in \(\mathbb F_{p^6}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746956)
