Efficient representations on Koblitz curves with resistance to side channel attacks

Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

Research output: Contribution to journalConference articlepeer-review

12 Citations (Scopus)

Abstract

Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently. For this reason, they are suitable candidates for implementations on low-end processors. However, such devices are often vulnerable to side channel attacks. In this paper, we propose two countermeasures against side channel attacks on Koblitz curves. Both of them utilize a fixed-pattern receding to defeat simple power analysis. Our first technique extends a known countermeasure to the special case of Koblitz curves. In our second technique, the scalar is recoded from left to right, and can be easily stored or even randomly generated.

Original languageEnglish
Pages (from-to)218-229
Number of pages12
JournalLecture Notes in Computer Science
Volume3574
Publication statusPublished - Oct 18 2005
Event10th Australasian Conference on Information Security and Privacy, ACISP 2005 - Brisbane, Australia
Duration: Jul 4 2005Jul 6 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient representations on Koblitz curves with resistance to side channel attacks'. Together they form a unique fingerprint.

Cite this