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 [21 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00176433
Contributor : Arnaud Tisserand <>
Submitted on : Wednesday, October 3, 2007 - 3:10:45 PM
Last modification on : Friday, December 13, 2019 - 11:36:02 AM
Long-term archiving on: Thursday, September 27, 2012 - 12:40:42 PM

Identifiers

Collections

Citation

Andrew Byrne, Francis Crowe, William Marnane, Nicolas Méloni, Arnaud Tisserand, et al.. SPA Resistant Elliptic Curve Cryptosystem Using Addition Chains. International Journal of High Performance Systems Architecture (IJHPSA), InterScience, 2007, 1 (2), pp.133-142. ⟨10.1504/IJHPSA.2007.015399⟩. ⟨lirmm-00176433⟩

Share

Metrics

Record views

346

Files downloads

715