@inproceedings{26947161b3904c26b52f68a5af979bc8,
title = "Efficient scalar multiplications on elliptic curves without repeated doublings and their practical performance",
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.",
author = "Yasuyuki Sakai and Kouichi Sakurai",
year = "2000",
month = jan,
day = "1",
doi = "10.1007/10718964_6",
language = "English",
isbn = "3540677429",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "59--73",
editor = "Ed Dawson and Andrew Clark and Colin Boyd",
booktitle = "Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings",
address = "Germany",
note = "5th Australasian Conference on Information Security and Privacy, ACISP 2000 ; Conference date: 10-07-2000 Through 12-07-2000",
}