Solving a 6120 -bit DLP on a Desktop Computer

DOI10.1007/978-3-662-43414-7_7MaRDI QIDQ2949526zbMATH OpenOpenAlexFDO

Authors Faruk Göloğlu, Robert Granger, Gary McGuire, Jens Zumbrägel

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

zbMATH Keywords

binary finite fieldsdiscrete logarithm problem

Mathematics Subject Classification ID

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

Recommendations

• Analysis of possible pre-computation aided DLP solving algorithms
• Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
• Solving 114-bit ECDLP for a Barreto-Naehrig curve
• Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster
• Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
• The connection machine: PDE solution on 65536 processors
• Computing the Discrete Fourier Transform on a Hexagonal Lattice
• scientific article; zbMATH DE number 1217788

Cited in

(18)

• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Indiscreet logarithms in finite fields of small characteristic
• Solving \(X^{q+1}+X+a=0\) over finite fields
• Updating key size estimations for pairings
• Almost perfect nonlinear trinomials and hexanomials
• Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\)
• 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
• Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
• scientific article; zbMATH DE number 2081061 (Why is no real title available?)
• On the discrete logarithm problem in finite fields of fixed characteristic
• Computation of a 30750-bit binary field discrete logarithm
• A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
• Roots of certain polynomials over finite fields
• A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
• Index calculus in the trace zero variety

This page was built for publication: Solving a $$6120$$ -bit DLP on a Desktop Computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949526)