Computing discrete logarithms in F_p^6
From MaRDI portal
Publication:1746956
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
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- scientific article; zbMATH DE number 475433 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - CRYPTO 2003
- An Implementation of the Number Field Sieve
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
- Bounds for resultants of univariate and bivariate polynomials
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- 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
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Extended tower number field sieve: a new complexity for the medium prime case
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Modifications to the number field sieve
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- On asymptotic complexity of computing discrete logarithms over GF(p)
- On the Discrete Logarithm Problem on Algebraic Tori
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Special Units in Real Cyclic Sextic Fields
- The Number Field Sieve in the Medium Prime Case
- The multiple number field sieve for medium- and high-characteristic finite fields
- The multiple number field sieve with conjugation and generalized Joux-Lercier methods
- The tower number field sieve
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Updating key size estimations for pairings
- Using number fields to compute logarithms in finite fields
Cited in
(9)- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
- Updating key size estimations for pairings
- On the Complexity of Computing Discrete Logarithms over Algebraic Tori
- Lattice sieving in three dimensions for discrete log in medium characteristic
- Higher-dimensional sieving for the number field sieve algorithms
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- scientific article; zbMATH DE number 5831613 (Why is no real title available?)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Faster individual discrete logarithms in finite fields of composite extension degree
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)
