Abstract
The scalar multiplication or point multiplication is the main computationnal operation in the most known cryptosystems based on elliptic curves. Therefore, relevant methods have been studied over centuries. This paper give a detailed study of the efficiency issues in scalar multiplication on the elliptic curves. First, we describe significant speedups in point multiplication. Second, we show that more optimizations can be achieved when better combination of multiplication methods for elliptic curves are performed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Miller, V.: Uses of elliptic curves in cryptography. In: Advances Groundwater Pollution Control. Advances in Cryptology, CRYPTO 1985, pp. 417–426 (1986)
Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203–209 (1987)
Cohen, H., Frey, G., Avanzi, R.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)
Blake, I., Seroussi, G., Smart, N.: Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, Cambridge University Press (2005)
Silverman, J.H.: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol. 106. Springer (1986)
Brier, E., Joye, M.: Fast point multiplication on elliptic curves through isogenies. In: Fossorier, M., Hoholdt, T., Poli, A. (eds.) Applied Algebra,Algebraic Algorithms and Error-Correcting Codes. LNCS, vol. 2643, pp. 43–50. Springer (2003)
Ciet, M., Joye, M., Lauter, K., Montgomery, P.: Trading inversion for multiplication in elliptic curve cryptography. J. Des. Codes Cryptogr. 39(2), 189–206 (2006)
Lim, C.H., Hwang, H.S.: Fast implementation of elliptic curve arithmetic in \(GF(p^n)\). In: Public Key Cryptography. LNCS, vol. 1751, pp. 455-461 (2000)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography, p. 92. Springer, Heidelberg (2004)
Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Proceedings of Advances in Cryptology - ASIACRYPT 1998, International Conference on the Theory and Applications of Cryptology and Information Security, Beijing, China, vol. 1514, pp. 51–65, 18–22 October 1998
Silverman, J.H.: Multiplication, fast, in finite fields \(GF(2^n)\). In: Cryptographic Hardware and Embedded Systems, CHES. Lecture Notes in Computer Science, vol. 1717. Springer, Heidelberg (1999)
Fay, B.: Double-and-add with relative Jacobian coordinates. Cryptology (2014). ePrint Archive
Longa, P., Miri, A.: New multibase non-adjacent form scalar multiplication and its application to elliptic curve cryptosystems (extended version). IACR Cryptology ePrint Archive 2008, 52 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ezzouak, S., Azizi, A. (2019). On the Efficiency of Scalar Multiplication on the Elliptic Curves. In: Rocha, Á., Serrhini, M. (eds) Information Systems and Technologies to Support Learning. EMENA-ISTL 2018. Smart Innovation, Systems and Technologies, vol 111. Springer, Cham. https://doi.org/10.1007/978-3-030-03577-8_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-03577-8_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03576-1
Online ISBN: 978-3-030-03577-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)