Faster elliptic curve point multiplication based on a novel greedy base-2,3 method

Aaron E. Cohen, Keshab K. Parhi

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

1 Scopus citations

Abstract

In this paper a novel pro-computation technique for scalar point multiplication on elliptic curves is proposed. Compared to standard affine coordinates without pre-computation this method achieves a performance increase of 23% while requiring an additional increase in control and logic for the pre-computation step. This method achieves a (2m bits × numpoints) reduction in storage overhead compared with other pre-computation techniques.

Original languageEnglish (US)
Title of host publicationISCAS 2006
Subtitle of host publication2006 IEEE International Symposium on Circuits and Systems, Proceedings
Pages3374-3377
Number of pages4
StatePublished - Dec 1 2006
EventISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems - Kos, Greece
Duration: May 21 2006May 24 2006

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
ISSN (Print)0271-4310

Other

OtherISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
CountryGreece
CityKos
Period5/21/065/24/06

Cite this