Solving a $$6120$$ -bit DLP on a Desktop Computer
From MaRDI portal
Publication:2949526
DOI10.1007/978-3-662-43414-7_7zbMath1321.11125OpenAlexW1409727619MaRDI QIDQ2949526
Faruk Göloğlu, Robert Granger, Jens Zumbrägel, Gary McGuire
Publication date: 1 October 2015
Published in: Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43414-7_7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (13)
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Index calculus in the trace zero variety ⋮ Roots of certain polynomials over finite fields ⋮ On the discrete logarithm problem in finite fields of fixed characteristic ⋮ Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\) ⋮ Solving \(X^{q+1}+X+a=0\) over finite fields ⋮ Updating key size estimations for pairings ⋮ Almost perfect nonlinear trinomials and hexanomials ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Point compression for the trace zero subgroup over a small degree extension field
This page was built for publication: Solving a $$6120$$ -bit DLP on a Desktop Computer
