Short memory scalar multiplication on Koblitz curves

Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

研究成果: ジャーナルへの寄稿Conference article

8 引用 (Scopus)

抄録

We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85%. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70%. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.

元の言語英語
ページ(範囲)91-105
ページ数15
ジャーナルLecture Notes in Computer Science
3659
出版物ステータス出版済み - 11 4 2005
イベント7th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2005 - Edinburgh, 英国
継続期間: 8 29 20059 1 2005

Fingerprint

Scalar multiplication
Data storage equipment
Curve
Hardware Implementation
Computer hardware
Software
Computing
Requirements

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Okeya, K., Takagi, T., & Vuillaume, C. (2005). Short memory scalar multiplication on Koblitz curves. Lecture Notes in Computer Science, 3659, 91-105.

Short memory scalar multiplication on Koblitz curves. / Okeya, Katsuyuki; Takagi, Tsuyoshi; Vuillaume, Camille.

:: Lecture Notes in Computer Science, 巻 3659, 04.11.2005, p. 91-105.

研究成果: ジャーナルへの寄稿Conference article

Okeya, K, Takagi, T & Vuillaume, C 2005, 'Short memory scalar multiplication on Koblitz curves', Lecture Notes in Computer Science, 巻. 3659, pp. 91-105.
Okeya K, Takagi T, Vuillaume C. Short memory scalar multiplication on Koblitz curves. Lecture Notes in Computer Science. 2005 11 4;3659:91-105.
Okeya, Katsuyuki ; Takagi, Tsuyoshi ; Vuillaume, Camille. / Short memory scalar multiplication on Koblitz curves. :: Lecture Notes in Computer Science. 2005 ; 巻 3659. pp. 91-105.
@article{e5a5ee33cc74434b91d3247edd8d22a4,
title = "Short memory scalar multiplication on Koblitz curves",
abstract = "We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85{\%}. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70{\%}. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.",
author = "Katsuyuki Okeya and Tsuyoshi Takagi and Camille Vuillaume",
year = "2005",
month = "11",
day = "4",
language = "English",
volume = "3659",
pages = "91--105",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Short memory scalar multiplication on Koblitz curves

AU - Okeya, Katsuyuki

AU - Takagi, Tsuyoshi

AU - Vuillaume, Camille

PY - 2005/11/4

Y1 - 2005/11/4

N2 - We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85%. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70%. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.

AB - We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85%. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70%. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.

UR - http://www.scopus.com/inward/record.url?scp=27244460246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27244460246&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:27244460246

VL - 3659

SP - 91

EP - 105

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -