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 metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Arnaud TISSERAND Connect in order to contact the contributor
Submitted on : Sunday, June 10, 2007 - 2:54:04 PM
Last modification on : Tuesday, September 6, 2022 - 5:01:16 PM
Long-term archiving on: : Thursday, April 8, 2010 - 7:29:36 PM



Andrew Byrne, Nicolas Méloni, Francis Crowe, William P. 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⟩



Record views


Files downloads