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

Vorapong Suppakitpaisarn*, Hiroshi Imai, Edahiro Masato

*この研究の対応する著者

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルWorld Congress on Internet Security, WorldCIS-2012
ページ93-98
ページ数6
出版ステータスPublished - 2012
外部発表はい
イベントWorld Congress on Internet Security, WorldCIS-2012 - Guelph, ON, Canada
継続期間: 2012 6月 102012 6月 12

出版物シリーズ

名前World Congress on Internet Security, WorldCIS-2012

Conference

ConferenceWorld Congress on Internet Security, WorldCIS-2012
国/地域Canada
CityGuelph, ON
Period12/6/1012/6/12

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Fastest multi-scalar multiplication based on optimal double-base chains」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル