Fastest multi-scalar multiplication based on optimal double-base chains

Vorapong Suppakitpaisarn, Hiroshi Imai, Edahiro Masato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We propose an algorithm to produce the optimal double-base chains (DBC) that minimize the time used for computing a multi-scalar multiplication, one of bottleneck operations of elliptic curve cryptosystem. The double-base chains are representations that combine binary and ternary representations. Since there are many possible sequences for a specific multi-scalar multiplication, we need to find an optimal sequence with smallest weighted sum of costs for elementary operations. Our algorithm is the first to attain the the fastest sequence with the same time complexity, O(lg 2 r), as existing greedy-type algorithms, by means of dynamic programming. Also, experimental results show that our algorithm reduces the time for computing multi-scalar multiplications by 3.2-11.3% in less than a second for 192 to 448 bit inputs with Java implementation on a personal computer.

Original languageEnglish
Title of host publicationWorld Congress on Internet Security, WorldCIS-2012
Pages93-98
Number of pages6
Publication statusPublished - 2012
Externally publishedYes
EventWorld Congress on Internet Security, WorldCIS-2012 - Guelph, ON, Canada
Duration: 2012 Jun 102012 Jun 12

Publication series

NameWorld Congress on Internet Security, WorldCIS-2012

Conference

ConferenceWorld Congress on Internet Security, WorldCIS-2012
CountryCanada
CityGuelph, ON
Period12/6/1012/6/12

Keywords

  • Cryptography
  • Double-Base Chains
  • Internet Security
  • Multi-Scalar Multiplication
  • Optimal Expansion

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Fastest multi-scalar multiplication based on optimal double-base chains'. Together they form a unique fingerprint.

Cite this