Power analysis breaks elliptic curve cryptosystems even secure against the timing attack

Katsuyuki Okeya, Kouichi Sakurai

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

79 Citations (Scopus)

Abstract

We apply power analysis on known elliptic curve cryptosystems, and consider an exact implementation of scalar multiplication on elliptic curves for resisting against power attacks. Our proposed algorithm does not decrease the computational performance compared to the conventional scalar multiplication algorithm, whereas previous methods did cost the performance or fail to protect against power analysis attacks.

Original languageEnglish
Title of host publicationProgress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings
EditorsBimal Roy, Eiji Okamoto
PublisherSpringer Verlag
Pages178-190
Number of pages13
ISBN (Print)3540414525, 9783540414520
Publication statusPublished - Jan 1 2000
Event1st International Conference in Cryptology in India, INDOCRYPT 2000 - Calcutta, India
Duration: Dec 10 2000Dec 13 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1977
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference in Cryptology in India, INDOCRYPT 2000
CountryIndia
CityCalcutta
Period12/10/0012/13/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Power analysis breaks elliptic curve cryptosystems even secure against the timing attack'. Together they form a unique fingerprint.

Cite this