Discrete logarithm in GF(2⁸⁰⁹) with FFS

DOI10.1007/978-3-642-54631-0_13MaRDI QIDQ5402973zbMATH OpenOpenAlexFDO

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

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 logarithmfunction field sievestate of the art

Mathematics Subject Classification ID

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

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

(14)

• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Indiscreet logarithms in finite fields of small characteristic
• A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
• 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
• Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
• Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
• scientific article; zbMATH DE number 5532108 (Why is no real title available?)
• scientific article; zbMATH DE number 2081061 (Why is no real title available?)
• Computing discrete logarithms
• A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
• Popping ``R-propping: breaking hardness assumptions for matrix groups over \(\mathbb{F}_{2^8}\)
• Index calculus in the trace zero variety
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity

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)