Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
From MaRDI portal
Publication:908042
DOI10.1007/s10623-015-0147-6zbMath1364.11165OpenAlexW2231274371MaRDI QIDQ908042
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0147-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$, ON BOUNDS FOR BALANCED EMBEDDING DEGREE, Still wrong use of pairings in cryptography, The Complexity of Public-Key Cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Function field sieve method for discrete logarithms over finite fields
- 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
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- 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
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Fast evaluation of logarithms in fields of characteristic two
- The Function Field Sieve in the Medium Prime Case
- Solving sparse linear equations over finite fields
- New directions in cryptography
- On the discrete logarithm problem in finite fields of fixed characteristic
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
- The Past, Evolving Present, and Future of the Discrete Logarithm
- Discrete Logarithm in GF(2809) with FFS
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Factoring polynomials over finite fields: A survey
