Efficient algorithms for scalar multiplication over elliptic curves
Čebyševskij sbornik, Tome 14 (2013) no. 4, pp. 180-187
Cet article a éte moissonné depuis la source Math-Net.Ru
The paper describes several algorithms for scalar multiplication over elliptic curves and compares the performance of their implementations.
Keywords:
elliptic curves.
@article{CHEB_2013_14_4_a15,
author = {A. S. Platonov and A. N. Gamova},
title = {Efficient algorithms for scalar multiplication over elliptic curves},
journal = {\v{C}eby\v{s}evskij sbornik},
pages = {180--187},
year = {2013},
volume = {14},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/CHEB_2013_14_4_a15/}
}
A. S. Platonov; A. N. Gamova. Efficient algorithms for scalar multiplication over elliptic curves. Čebyševskij sbornik, Tome 14 (2013) no. 4, pp. 180-187. http://geodesic.mathdoc.fr/item/CHEB_2013_14_4_a15/
[1] Solinas J. A., “Efficient Arithmetic on Koblitz Curves”, Journal Designs, Codes and Cryptography, 19:2–3 (2000), 195–249 | DOI | MR | Zbl
[2] Platonov A. S., Gamova A. N., “Projective coordinates for elliptic curve cryptography”, Computer Science and Information Technology, Proceedings of the International Scientific Conference (Saratov, 2012), 256–258 (in Russian)