Skip to Main content Skip to Navigation
Conference papers

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

Christophe Doche 1 Laurent Imbert 2 
2 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Laurent Imbert Connect in order to contact the contributor
Submitted on : Friday, January 19, 2007 - 3:09:10 PM
Last modification on : Tuesday, September 6, 2022 - 4:53:32 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 9:05:45 PM



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⟩



Record views


Files downloads