Short memory scalar multiplication on Koblitz curves

Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

Research output: Contribution to journalConference article

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)91-105
Number of pages15
JournalLecture Notes in Computer Science
Volume3659
DOIs
Publication statusPublished - 2005
Event7th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2005 - Edinburgh, United Kingdom
Duration: Aug 29 2005Sep 1 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Short memory scalar multiplication on Koblitz curves'. Together they form a unique fingerprint.

Cite this