Securing the Elliptic Curve Montgomery Ladder against Fault Attacks
Authors:
- Nevine EbeidNENevine Ebeid
- Rob LambertRLRob Lambert
- 1 September 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 46-50
Abstract
The Montgomery ladder method of computing elliptic curve scalar multiplication is esteemed as an efficient algorithm, inherently resistant to simple side-channel attacks as well as to various fault attacks. In FDTC 08, Fouque et al. present an attack on the Montgomery ladder in the presence of a point validation countermeasure, when the y-coordinate is not used. In this paper, we present an efficient countermeasure that renders the algorithm resistant to this attack as well as to other known fault attacks.Keywords
This publication has 7 references indexed in Scilit:
- Fault Attack on Elliptic Curve Montgomery Ladder Implementation2008
- Elliptic Curve Cryptosystems in the Presence of Permanent and Transient FaultsDesigns, Codes and Cryptography, 2005
- A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks2002
- Elliptic Curve Based Password Authenticated Key Exchange ProtocolsLecture Notes in Computer Science, 2001
- On the Importance of Eliminating Errors in Cryptographic ComputationsJournal of Cryptology, 2000
- Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems1999
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987