On the Efficiency of Scalar Multiplication on the Elliptic Curves

  • Siham EzzouakEmail author
  • Abdelmalek Azizi
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 111)


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.


Elliptic curves Jacobian coordinate Chudnovasky coordinate Binary method NAF method Scalar multiplication 


  1. 1.
    Miller, V.: Uses of elliptic curves in cryptography. In: Advances Groundwater Pollution Control. Advances in Cryptology, CRYPTO 1985, pp. 417–426 (1986)Google Scholar
  2. 2.
    Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203–209 (1987)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Cohen, H., Frey, G., Avanzi, R.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)CrossRefGoogle Scholar
  4. 4.
    Blake, I., Seroussi, G., Smart, N.: Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, Cambridge University Press (2005)Google Scholar
  5. 5.
    Silverman, J.H.: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol. 106. Springer (1986)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)MathSciNetCrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography, p. 92. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  10. 10.
    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 1998Google Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Fay, B.: Double-and-add with relative Jacobian coordinates. Cryptology (2014). ePrint ArchiveGoogle Scholar
  13. 13.
    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)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Laboratory LAGA, Faculty of SciencesDhar El Mahraz Sidi Mohamed Ben Abdellah UniversityFesMorocco
  2. 2.Laboratory ACSA, Faculty of ScienceUniversity Mohammed First Oujda MoroccoOujdaMorocco

Personalised recommendations