Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster

DOI10.1007/978-3-319-13051-4_22zbMath1382.94168OpenAlexW2113258106MaRDI QIDQ2798629

Erich Wenger, Paul Wolfger

Publication date: 13 April 2016

Published in: Selected Areas in Cryptography -- SAC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13051-4_22

zbMATH Keywords

discrete logarithm problemelliptic curve cryptographyhardware designKoblitz curvefpgadiscrete logarithm record

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ Koblitz curves over quadratic fields

This page was built for publication: Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster