Discrete logarithm in GF(2⁸⁰⁹) with FFS
From MaRDI portal
Publication:5402973
Recommendations
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- scientific article; zbMATH DE number 2081061
- scientific article; zbMATH DE number 2086903
- New discrete logarithm computation for the medium prime case using the function field sieve
- The Number Field Sieve in the Medium Prime Case
Cited in
(12)- Index calculus in the trace zero variety
- scientific article; zbMATH DE number 2081061 (Why is no real title available?)
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Point compression for the trace zero subgroup over a small degree extension field
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- Computing discrete logarithms
- scientific article; zbMATH DE number 5532108 (Why is no real title available?)
- Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
- Indiscreet logarithms in finite fields of small characteristic
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
This page was built for publication: Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402973)