Fault-based attack on Montgomery's ladder algorithm

DOI10.1007/S00145-010-9087-5zbMATH Open1251.94026OpenAlexW2069859460MaRDI QIDQ656523FDOQ656523

Authors: Agustin Dominguez-Oviedo, Bijan Ansari, M. Anwar 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

Recommendations

• Fault attacks on the Montgomery powering ladder
• Differential fault attack on Montgomery ladder and in the presence of scalar randomization
• Fault based attack of the Rijndael cryptosystem
• A Fault Attack on Pairing-Based Cryptography
• An Improved Fault Based Attack of the Advanced Encryption Standard
• Fault attacks on pairing-based cryptography
• Information Security and Cryptology - ICISC 2005
• Fault attacks on elliptic curve cryptosystems
• Fault attacks against RSA-CRT implementation
• Structure-based RSA fault attacks

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationinvalid-curve attacksfault-based attacksMontgomery ladder

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
• Exceptional Procedure Attack on Elliptic Curve Cryptosystems
• Fault attacks on hyperelliptic curve discrete logarithm problem over binary field
• Information Security and Cryptology - ICISC 2005

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

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