Paper Info
Title
A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks
Abstract
In this paper, we propose a scalar multiplication method that does not incur a higher computational cost for randomized projective coordinates of the Montgomery form of elliptic curves. A randomized projective coordinates method is a countermeasure against side channel attacks on an elliptic curve cryptosystem in which an attacker cannot predict the appearance of a specific value because the coordinates have been randomized. However, because of this randomization, we cannot assume the Z-coordinate to be 1. Thus, the computational cost increases by multiplications of Z-coordinates, 10%. Our results clarify the advantages of cryptographic usage of Montgomery-form elliptic curves in constrained environments such as mobile devices and smart cards.
Year
DOI
Venue
2001
10.1007/3-540-45861-1_32
ICISC
Keywords
Field
DocType
computational cost increase,montgomery-form elliptic curve secure,elliptic curve cryptosystem,scalar multiplication method,side channel attacks,randomized projective coordinates,higher computational cost,elliptic curve,cryptographic usage,fast scalar multiplication method,montgomery-form elliptic curve,mobile device,montgomery form,randomized projective,smart card,scalar multiplication
Discrete mathematics,Homogeneous coordinates,Scalar multiplication,Cryptography,Computer science,Smart card,Theoretical computer science,Elliptic curve point multiplication,Side channel attack,Elliptic curve,Tripling-oriented Doche–Icart–Kohel curve
Conference
ISBN
Citations 
PageRank 
3-540-43319-8
14
1.08
References 
Authors
12
3
Name
Order
Citations
PageRank
Katsuyuki Okeya144738.47
Kunihiko Miyazaki220114.70
Kouichi Sakurai31514213.71