Efficient scalar multiplications on elliptic curves without repeated doublings and their practical performance

Yasuyuki Sakai, Kouichi Sakurai

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

7 Citations (Scopus)

Abstract

We introduce efficient algorithms for scalar multiplication on elliptic curves defined over 1Fp. The algorithms compute 2fc P directly from P, where P is a random point on an elliptic curve, without computing the intermediate points, which is faster than k repeated doublings. Moreover, we apply the algorithms to scalar multiplication on elliptic curves, and analyze their computational complexity. As a result of their implementation with respect to affine (resp. weighted projective) coordinates, we achieved an increased performance factor of 1.45 (45%) (resp. 1.15 (15%)) in the scalar multiplication of the elliptic curve of size 160bit.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings
EditorsEd Dawson, Andrew Clark, Colin Boyd
PublisherSpringer Verlag
Pages59-73
Number of pages15
ISBN (Print)3540677429
DOIs
Publication statusPublished - Jan 1 2000
Event5th Australasian Conference on Information Security and Privacy, ACISP 2000 - Brisbane, Australia
Duration: Jul 10 2000Jul 12 2000

Publication series

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

Other

Other5th Australasian Conference on Information Security and Privacy, ACISP 2000
CountryAustralia
CityBrisbane
Period7/10/007/12/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient scalar multiplications on elliptic curves without repeated doublings and their practical performance'. Together they form a unique fingerprint.

Cite this