Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
From MaRDI portal
Publication:2512887
DOI10.1016/j.ffa.2014.10.009zbMath1307.94032OpenAlexW1993819992MaRDI QIDQ2512887
Francisco Rodríguez-Henríquez, Thomaz Oliveira, Gora Adj, Alfred J. Menezes
Publication date: 30 January 2015
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.10.009
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (8)
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ Updating key size estimations for pairings ⋮ Faster initial splitting for small characteristic composite extension degree fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Short signatures from the Weil pairing
- Function field sieve method for discrete logarithms over finite fields
- 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
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- 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
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Solving sparse linear equations over finite fields
- New directions in cryptography
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- 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
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Fuzzy Identity-Based Encryption
- Discrete Logarithm in GF(2809) with FFS
- 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: Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
