Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
From MaRDI portal
Publication:1620973
Recommendations
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
- Indiscreet logarithms in finite fields of small characteristic
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
Cites work
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A new efficient algorithm for computing Gröbner bases (F₄)
- A new index calculus algorithm with complexity L(1/4+o(1)) in small characteristic
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- 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}}\))
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Computing Logarithms in Finite Fields of Characteristic Two
- Counting irreducible factors of polynomials over a finite field
- Discrete logarithms and local units
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Efficient pairing computation on supersingular abelian varieties
- Fast evaluation of logarithms in fields of characteristic two
- scientific article; zbMATH DE number 1942431 (Why is no real title available?)
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 2081083 (Why is no real title available?)
- scientific article; zbMATH DE number 2086895 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- On the discrete logarithm problem in finite fields of fixed characteristic
- On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Short signatures from the Weil pairing
- Solving a 6120 -bit DLP on a Desktop Computer
- Solving sparse linear equations over finite fields
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- The Function Field Sieve in the Medium Prime Case
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
Cited in
(11)- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Updating key size estimations for pairings
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Indiscreet discrete logarithms
- Faster individual discrete logarithms in finite fields of composite extension degree
- Computation of a 30750-bit binary field discrete logarithm
- Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- Implications of the arithmetic ratio of prime numbers for RSA security
- A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
This page was built for publication: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1620973)
