The Double-Base Number System and its Application to Elliptic Curve Cryptography - Archive ouverte HAL Access content directly
Journal Articles Mathematics of Computation Year : 2008

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

(1) , (2, 3, 1) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
dbns_ecc_mathcomp_2008.pdf (372.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00341742 , version 1 (18-03-2022)

Identifiers

  • HAL Id : lirmm-00341742 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More