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

Katsuyuki Okeya; Kouichi Sakurai

doi:10.1007/3-540-44495-5_16

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

Katsuyuki Okeya, Kouichi Sakurai

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

25 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 language	English
Title of host publication	Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings
Editors	Bimal Roy, Eiji Okamoto
Publisher	Springer Verlag
Pages	178-190
Number of pages	13
ISBN (Print)	3540414525, 9783540414520
DOIs	https://doi.org/10.1007/3-540-44495-5_16
Publication status	Published - 2000
Event	1st International Conference in Cryptology in India, INDOCRYPT 2000 - Calcutta, India Duration: Dec 10 2000 → Dec 13 2000

Publication series

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

Other

Other	1st International Conference in Cryptology in India, INDOCRYPT 2000
Country/Territory	India
City	Calcutta
Period	12/10/00 → 12/13/00

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-44495-5_16

Cite this

Okeya, K., & Sakurai, K. (2000). Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. In B. Roy, & E. Okamoto (Eds.), Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings (pp. 178-190). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1977). Springer Verlag. https://doi.org/10.1007/3-540-44495-5_16

Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. / Okeya, Katsuyuki; Sakurai, Kouichi.
Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings. ed. / Bimal Roy; Eiji Okamoto. Springer Verlag, 2000. p. 178-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1977).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Okeya, K & Sakurai, K 2000, Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. in B Roy & E Okamoto (eds), Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1977, Springer Verlag, pp. 178-190, 1st International Conference in Cryptology in India, INDOCRYPT 2000, Calcutta, India, 12/10/00. https://doi.org/10.1007/3-540-44495-5_16

Okeya K, Sakurai K. Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. In Roy B, Okamoto E, editors, Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings. Springer Verlag. 2000. p. 178-190. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44495-5_16

Okeya, Katsuyuki ; Sakurai, Kouichi. / Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings. editor / Bimal Roy ; Eiji Okamoto. Springer Verlag, 2000. pp. 178-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{79003f6b1e42407895bc062845d1638c,

title = "Power analysis breaks elliptic curve cryptosystems even secure against the timing attack",

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.",

author = "Katsuyuki Okeya and Kouichi Sakurai",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 1st International Conference in Cryptology in India, INDOCRYPT 2000 ; Conference date: 10-12-2000 Through 13-12-2000",

year = "2000",

doi = "10.1007/3-540-44495-5_16",

language = "English",

isbn = "3540414525",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "178--190",

editor = "Bimal Roy and Eiji Okamoto",

booktitle = "Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings",

address = "Germany",

}

TY - GEN

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

AU - Okeya, Katsuyuki

AU - Sakurai, Kouichi

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/3-540-44495-5_16

DO - 10.1007/3-540-44495-5_16

M3 - Conference contribution

AN - SCOPUS:84947733936

SN - 3540414525

SN - 9783540414520

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 178

EP - 190

BT - Progress in Cryptology - INDOCRYPT 2000 - 1st International Conference in Cryptology in India, Proceedings

A2 - Roy, Bimal

A2 - Okamoto, Eiji

PB - Springer Verlag

T2 - 1st International Conference in Cryptology in India, INDOCRYPT 2000

Y2 - 10 December 2000 through 13 December 2000

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this