HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

The Double-Base Number System and its Application to Elliptic Curve Cryptography

Abstract : We describe an algorithm for point multiplication on generic elliptic curves, based on a representation of the scalar as a sum of mixed powers of 2 and 3. The sparseness of this so-called double-base number system, combined with some efficient point tripling formulae, lead to efficient point multiplication algorithms for curves defined over both prime and binary fields. Side-channel resistance is provided thanks to side-channel atomicity.
Document type :
Journal articles
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00341742
Contributor : Laurent Imbert Connect in order to contact the contributor
Submitted on : Friday, March 18, 2022 - 9:43:50 AM
Last modification on : Thursday, May 12, 2022 - 8:42:10 AM

File

dbns_ecc_mathcomp_2008.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00341742, version 1

Citation

Vassil Dimitrov, Laurent Imbert, Pradeep Mishra. The Double-Base Number System and its Application to Elliptic Curve Cryptography. Mathematics of Computation, American Mathematical Society, 2008, 77 (262), pp.1075-1104. ⟨lirmm-00341742⟩

Share

Metrics

Record views

74

Files downloads

2