Skip to Main content Skip to Navigation
Journal articles

Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem

Abstract : There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks such as Simple Power Analysis (SPA) attacks. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to these attacks. The protected double and add algorithm provides a simple solution to this problem but is costly in terms of performance. Another class of algorithm for point scalar multiplication that makes use of special addition chains can be used to protect against SPA attacks. A reconfigurable architecture for a cryptographic processor is presented and a number of algorithms for point multiplication are implemented and compared. These algorithms have a degree of parallelism within their operations where a number of multiplications can be executed in parallel. Sophisticated scheduling techniques can exploit this parallelism in order to optimize the performance of the calculation. Post place and route results for the processor are given.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00174648
Contributor : Arnaud Tisserand <>
Submitted on : Friday, January 11, 2008 - 10:39:55 AM
Last modification on : Monday, June 15, 2020 - 1:38:03 PM
Long-term archiving on: : Friday, April 9, 2010 - 2:46:07 AM

Identifiers

  • HAL Id : lirmm-00174648, version 1

Collections

Citation

Andrew Byrne, Nicolas Méloni, Arnaud Tisserand, Emanuel Popovici, William Marnane. Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem. Journal of Computers (JCP), Academy Publisher, 2007, 2 (10), pp.52-62. ⟨lirmm-00174648⟩

Share

Metrics

Record views

321

Files downloads

311