Extended Double-Base Number System with Applications to Elliptic Curve Cryptography - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Extended Double-Base Number System with Applications to Elliptic Curve Cryptography

(1) , (2)
1
2

Abstract

We investigate the impact of larger digit sets on the length of Double-Base Number system (DBNS) expansions. We present a new representation system called extended DBNS whose expansions can be extremely sparse. When compared with double-base chains, the average length of extended DBNS expansions of integers of size in the range 200– 500 bits is approximately reduced by 20% using one precomputed point, 30% using two, and 38% using four. We also discuss a new approach to approximate an integer n by d2^a3^b where d belongs to a given digit set. This method, which requires some precomputations as well, leads to realistic DBNS implementations. Finally, a left-to-right scalar multiplication relying on extended DBNS is given. On an elliptic curve where operations are performed in Jacobian coordinates, improvements of up to 13% overall can be expected with this approach when compared to window NAF methods using the same number of precomputed points. In this context, it is therefore the fastest method known to date to compute a scalar multiplication on a generic elliptic curve.
Fichier principal
Vignette du fichier
DocImb06a_indocrypt06.pdf (266.36 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00125442 , version 1 (19-01-2007)

Identifiers

Cite

Christophe Doche, Laurent Imbert. Extended Double-Base Number System with Applications to Elliptic Curve Cryptography. INDOCRYPT, Dec 2006, Kolkata, India. pp.335-348, ⟨10.1007/11941378_24⟩. ⟨lirmm-00125442⟩
126 View
438 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More