Randomized windows for secure scalar multiplication on elliptic curves

Author

Pontie, Simon ; Maistri, P.

Author_Institution

TIMA, Univ. Grenoble Alpes, Grenoble, France

fYear

2014

fDate

18-20 June 2014

Firstpage

78

Lastpage

79

Abstract

Elliptic curve cryptosystems (ECCs) may be chosen instead of RSA in secure embedded systems, thanks to shorter keys. However, ECC may be vulnerable, as any other cryptographic implementation, to side channel analysis, which may reveal secret information by analyzing collateral sources of information, such as power consumption. To protect the device against Timing, Simple and Differential Power Analysis, we propose the implementation of a new scalar multiplication algorithm based on randomized windows method.

Keywords

digital arithmetic; embedded systems; power consumption; public key cryptography; ECC; RSA; collateral information sources; cryptographic implementation; differential power analysis; elliptic curve cryptosystems; power consumption; randomized windows; randomized windows method; scalar multiplication algorithm; secret information; secure embedded systems; secure scalar multiplication; side channel analysis; Acceleration; Algorithm design and analysis; Computational efficiency; Elliptic curve cryptography; Elliptic curves; Partitioning algorithms; Elliptic curves; power analysis; scalar multiplication; side channel analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Application-specific Systems, Architectures and Processors (ASAP), 2014 IEEE 25th International Conference on

Conference_Location

Zurich

Type

conf

DOI

10.1109/ASAP.2014.6868638

Filename

6868638