Discrete Logarithm in GF(2809) with FFS

DOI10.1007/978-3-642-54631-0_13zbMath1335.94029OpenAlexW2019084171MaRDI QIDQ5402973

Jérémie Detrey, Emmanuel Thomé, Paul Zimmermann, Cyril Bouvier, Marion Videau, Pierrick Gaudry, Hamza Jeljeli, Razvan Barbulescu

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_13

zbMATH Keywords

cryptanalysisdiscrete logarithmstate of the artfunction field sieve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (7)

Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ Index calculus in the trace zero variety ⋮ A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography ⋮ Point compression for the trace zero subgroup over a small degree extension field

This page was built for publication: Discrete Logarithm in GF(2809) with FFS