2008•Unpublished venueRequires access

The double-base number system in elliptic curve cryptography

Christophe Doche, Laurent Imbert

Open publisher page 3 citations

Abstract

Three algorithms for double-scalar multiplication on elliptic curves, based on the representations of a pair of integers as mixed powers of 2 and 3, are presented.

About this research paper

What this paper is about

Three algorithms for double-scalar multiplication on elliptic curves, based on the representations of a pair of integers as mixed powers of 2 and 3, are presented.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Three algorithms for double-scalar multiplication on elliptic curves, based on the representations of a pair of integers as mixed powers of 2 and 3, are presented.

Key concepts: Elliptic curve cryptography, Scalar multiplication, Elliptic curve, Elliptic Curve Digital Signature Algorithm, Mathematics, Elliptic curve point multiplication, Cryptography, Base (topology)

Related papers

Back to paper searchBrowse research topicsOriginal source
The double-base number system in elliptic curve cryptography — Research Paper | ScholarLens