EFFICIENT ALGORITHMS FOR SCALAR MULTIPLICATION OVER ELLIPTIC CURVES
https://doi.org/10.22405/2226-8383-2013-14-4-180-187
Abstract
The paper describes several algorithms for scalar multiplication over elliptic curves and compares the performance of their implementations.
About the Authors
A. S. Platonov
Саратовский государственный университет им. Н. Г. Чернышевского
Russian Federation
Russian Federation
A. N. Gamova
Саратовский государственный университет им. Н. Г. Чернышевского
Russian Federation
Russian Federation
References
1. Solinas J. A. Efficient Arithmetic on Koblitz Curves // Journal Designs, Codes and Cryptography. 2000. Vol. 19, № 2-3. pp. 195–249.
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. pp. 256–258 (in Russian).
3.
Review
For citations:
Platonov A.S., Gamova A.N. EFFICIENT ALGORITHMS FOR SCALAR MULTIPLICATION OVER ELLIPTIC CURVES. Chebyshevskii Sbornik. 2013;14(4):180-187. (In Russ.) https://doi.org/10.22405/2226-8383-2013-14-4-180-187
Views:
386
Email this article 