Improved elliptic curve multiplication methods resistant against side channel attacks

Tetsuya Izu, Bodo Möller, Tsuyoshi Takagi

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

51 Citations (Scopus)

Abstract

We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCA resistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.

Original languageEnglish
Title of host publicationProgress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings
EditorsPalash Sarkar, Alfred Menezes
PublisherSpringer Verlag
Pages296-313
Number of pages18
ISBN (Print)9783540362319
Publication statusPublished - Jan 1 2002
Event3rd International Conference on Cryptology in India, INDOCRYPT 2002 - Hyderabad, India
Duration: Dec 16 2002Dec 18 2002

Publication series

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

Other

Other3rd International Conference on Cryptology in India, INDOCRYPT 2002
CountryIndia
CityHyderabad
Period12/16/0212/18/02

Fingerprint

Side Channel Attacks
Elliptic Curves
Multiplication
Curve
Data storage equipment
Side channel attack

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Izu, T., Möller, B., & Takagi, T. (2002). Improved elliptic curve multiplication methods resistant against side channel attacks. In P. Sarkar, & A. Menezes (Eds.), Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings (pp. 296-313). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2551). Springer Verlag.

Improved elliptic curve multiplication methods resistant against side channel attacks. / Izu, Tetsuya; Möller, Bodo; Takagi, Tsuyoshi.

Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings. ed. / Palash Sarkar; Alfred Menezes. Springer Verlag, 2002. p. 296-313 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2551).

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

Izu, T, Möller, B & Takagi, T 2002, Improved elliptic curve multiplication methods resistant against side channel attacks. in P Sarkar & A Menezes (eds), Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2551, Springer Verlag, pp. 296-313, 3rd International Conference on Cryptology in India, INDOCRYPT 2002, Hyderabad, India, 12/16/02.
Izu T, Möller B, Takagi T. Improved elliptic curve multiplication methods resistant against side channel attacks. In Sarkar P, Menezes A, editors, Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings. Springer Verlag. 2002. p. 296-313. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Izu, Tetsuya ; Möller, Bodo ; Takagi, Tsuyoshi. / Improved elliptic curve multiplication methods resistant against side channel attacks. Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings. editor / Palash Sarkar ; Alfred Menezes. Springer Verlag, 2002. pp. 296-313 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8810a97d9ade491780f3ff9647bd4720,
title = "Improved elliptic curve multiplication methods resistant against side channel attacks",
abstract = "We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCA resistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.",
author = "Tetsuya Izu and Bodo M{\"o}ller and Tsuyoshi Takagi",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "9783540362319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "296--313",
editor = "Palash Sarkar and Alfred Menezes",
booktitle = "Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Improved elliptic curve multiplication methods resistant against side channel attacks

AU - Izu, Tetsuya

AU - Möller, Bodo

AU - Takagi, Tsuyoshi

PY - 2002/1/1

Y1 - 2002/1/1

N2 - We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCA resistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.

AB - We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCA resistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.

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

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

M3 - Conference contribution

AN - SCOPUS:84974665915

SN - 9783540362319

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

SP - 296

EP - 313

BT - Progress in Cryptology - INDOCRYPT 2002 - 3rd International Conference on Cryptology in India, Proceedings

A2 - Sarkar, Palash

A2 - Menezes, Alfred

PB - Springer Verlag

ER -