Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
From MaRDI portal
Publication:1620973
DOI10.3934/amc.2018044zbMath1402.94049OpenAlexW2893614166WikidataQ129186783 ScholiaQ129186783MaRDI QIDQ1620973
Francisco Rodríguez-Henríquez, Nareli Cruz-Cortés, Isaac Canales-Martínez, Gora Adj, Thomaz Oliveira, Luis Rivera-Zamarripa, Alfred J. Menezes
Publication date: 15 November 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018044
Related Items (4)
Implications of the arithmetic ratio of prime numbers for RSA security ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Updating key size estimations for pairings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- Counting irreducible factors of polynomials over a finite field
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Short signatures from the Weil pairing
- Efficient pairing computation on supersingular abelian varieties
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Fast evaluation of logarithms in fields of characteristic two
- Computing Logarithms in Finite Fields of Characteristic Two
- The Function Field Sieve in the Medium Prime Case
- Solving sparse linear equations over finite fields
- Discrete logarithms and local units
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- On the discrete logarithm problem in finite fields of fixed characteristic
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
This page was built for publication: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
