Faster attacks on elliptic curve cryptosystems

DOI10.1007/3-540-48892-8_15MaRDI QIDQ4250816zbMATH OpenFDO

Authors Michael J. Wiener, Robert J. Zuccherato

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48892-8_15

zbMATH Keywords

attackselliptic curve cryptosystemselliptic curve discrete logarithm problemKoblitz curves

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 708816
• Reducing elliptic curve logarithms to logarithms in a finite field
• CM-curves with good cryptographic properties
• On random walks of Pollard's rho method for the ECDLP on Koblitz curves

Cited in

(41)

• A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two
• Koblitz curve cryptosystems
• Speeding up elliptic curve discrete logarithm computations with point halving
• Improved classical cryptanalysis of SIKE in practice
• Improved cryptanalysis of the KMOV elliptic curve cryptosystem
• Koblitz curves over quadratic fields
• Cycle structure of iterating Rédei functions
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Elliptic curve cryptography: the serpentine course of a paradigm shift
• On Edwards curves and ZVP-attacks
• Fast cryptography in genus 2
• On the heuristic of approximating polynomials over finite fields by random mappings
• Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Zero-Value Point Attacks on Elliptic Curve Cryptosystem
• Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
• Speeding Up the Pollard Rho Method on Prime Fields
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Analysis of the fault attack ECDLP over prime field
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Accelerating Pollard's rho algorithm on finite fields
• scientific article; zbMATH DE number 1979277 (Why is no real title available?)
• Improved Pollard rho method for computing discrete logarithms over finite extension fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Computing elliptic curve discrete logarithms with the negation map
• On random walks of Pollard's rho method for the ECDLP on Koblitz curves
• Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks
• Periods of iterations of mappings over finite fields with restricted preimage sizes
• Computational hardness of IFP and ECDLP
• ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography
• Progress in Cryptology - INDOCRYPT 2004
• Dynamics of polynomial maps over finite fields
• On index calculus algorithms for subfield curves
• Generating anomalous elliptic curves
• Recent progress on the elliptic curve discrete logarithm problem

This page was built for publication: Faster attacks on elliptic curve cryptosystems

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