DocumentCode
3463694
Title
Securing the Elliptic Curve Montgomery Ladder against Fault Attacks
Author
Ebeid, Nevine ; Lambert, Rob
Author_Institution
Res. In Motion Ltd., Certicom Corp., Mississauga, ON, Canada
fYear
2009
fDate
6-6 Sept. 2009
Firstpage
46
Lastpage
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
cryptography; security of data; Montgomery ladder; elliptic curve scalar multiplication; fault attacks; point validation countermeasure; side-channel attacks; Costs; Elliptic curve cryptography; Elliptic curves; Fault diagnosis; IEEE news; Security; Timing; Elliptic curve cryptosystems; Montgomery ladder for scalar multiplication; fault attacks; twist of a curve;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault Diagnosis and Tolerance in Cryptography (FDTC), 2009 Workshop on
Conference_Location
Lausanne
Print_ISBN
978-1-4244-4972-9
Type
conf
DOI
10.1109/FDTC.2009.35
Filename
5412859
Link To Document