A new side channel resistant scalar point multiplication method for binary elliptic curves

Aaron E. Cohen, Keshab K Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In this paper, a new novel LSB scalar point multiplication algorithm resistant to several side channel attacks is presented. This method is based on a similar invariant principle to Montgomery's Ladder but it can use pre-computation to halve the total runtime and achieve a speedup of l(A +D 1)/(lA + D2). Using D2 ≈ 1.5D1 and D1≈A, then the proposed method achieves 2lA/(l + 1.5)A) or a speedup of 2 as l, the number of scalar point multiplications on an identical base point, approaches infinity. This performance was achieved by applying the reduced complexity Montgomery Invariant point addition equation along with y-coordinate recovery to generate the point Q equal to kP. Finally, the LSB Invariant method is adapted to projective coordinates to achieve a further performance increase when the penalty for performing a field inversion operation is greater than 4 multiplications.

Original languageEnglish (US)
Title of host publicationConference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Pages1205-1209
Number of pages5
DOIs
StatePublished - Dec 1 2006
Event40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 - Pacific Grove, CA, United States
Duration: Oct 29 2006Nov 1 2006

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
CountryUnited States
CityPacific Grove, CA
Period10/29/0611/1/06

Fingerprint Dive into the research topics of 'A new side channel resistant scalar point multiplication method for binary elliptic curves'. Together they form a unique fingerprint.

Cite this