A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks

Katsuyuki Okeya, Kunihiko Miyazaki, Kouichi Sakurai

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

24 Citations (Scopus)

Abstract

In this paper, we propose a scalar multiplication method that does not incur a higher computational cost for randomized projective coordinates of the Montgomery form of elliptic curves. A randomized projective coordinates method is a countermeasure against side channel attacks on an elliptic curve cryptosystem in which an attacker cannot predict the appearance of a specific value because the coordinates have been randomized. However, because of this randomization, we cannot assume the Z-coordinate to be 1. Thus, the computational cost increases by multiplications of Z-coordinates, 10%. Our results clarify the advantages of cryptographic usage of Montgomery-form elliptic curves in constrained environments such as mobile devices and smart cards.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings
EditorsKwangjo Kim
PublisherSpringer Verlag
Pages428-439
Number of pages12
ISBN (Print)3540433198, 9783540433194
DOIs
Publication statusPublished - 2002
Event4th International Conference on Information Security and Cryptology, ICISC 2001 - Seoul, Korea, Republic of
Duration: Dec 6 2001Dec 7 2001

Publication series

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

Other

Other4th International Conference on Information Security and Cryptology, ICISC 2001
CountryKorea, Republic of
CitySeoul
Period12/6/0112/7/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks'. Together they form a unique fingerprint.

Cite this