Skip to Main content Skip to Navigation
Conference papers

SPA Resistant Elliptic Curve Cryptosystem using Addition Chains

Abstract : There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to such attacks. By making use of special addition chains, it is possible to implement a Simple Power Analysis (SPA) resistant cryptosystem. In this paper a reconfigurable architecture for a cryptographic processor is presented. A SPA resistant algorithm for point multiplication is implemented and is shown to be faster than the double-and-add method. Post place and route results for the processor are given.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00153368
Contributor : Arnaud Tisserand <>
Submitted on : Sunday, June 10, 2007 - 2:54:04 PM
Last modification on : Monday, June 15, 2020 - 1:38:03 PM
Long-term archiving on: : Thursday, April 8, 2010 - 7:29:36 PM

Identifiers

Collections

Citation

Andrew Byrne, Nicolas Méloni, Francis Crowe, William Marnane, Arnaud Tisserand, et al.. SPA Resistant Elliptic Curve Cryptosystem using Addition Chains. ITNG'07: 4th International Conference on Information Technology, Apr 2007, Las Vegas, Nevada, U.S.A., pp.995-1000, ⟨10.1109/ITNG.2007.185⟩. ⟨lirmm-00153368⟩

Share

Metrics

Record views

286

Files downloads

401