Fault-based attack on Montgomery's ladder algorithm

DOI10.1007/s00145-010-9087-5zbMath1251.94026OpenAlexW2069859460MaRDI QIDQ656523

Bijan Ansari, Agustin Dominguez-Oviedo, M. Anwarul Hasan

Publication date: 18 January 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-010-9087-5

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationinvalid-curve attacksfault-based attacksMontgomery ladder

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 (1)

Fault attacks on hyperelliptic curve discrete logarithm problem over binary field

Cites Work

• Zero-knowledge proofs of identity
• Efficient signature generation by smart cards
• Parallel collision search with cryptanalytic applications
• Constructive and destructive facets of Weil descent on elliptic curves
• Fast computation of canonical lifts of elliptic curves and its application to point counting.
• Elliptic curve cryptosystems in the presence of permanent and transient faults
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• A Note on Elliptic Curves Over Finite Fields
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Reducing elliptic curve logarithms to logarithms in a finite field
• Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
• Validation of Elliptic Curve Public Keys
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
• On the importance of eliminating errors in cryptographic computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fault-based attack on Montgomery's ladder algorithm