Overview of scalar multiplication in elliptic curve cryptography

Abstract

Scalar multiplication in elliptic curve cryptography is the most important part, its direct impact on the performance of the whole cryptosystem implementation. First of all, this article on the mathematical foundations of Elliptic Curve Cryptography Overview, respectively on excellent performance overview of scalar multiplication algorithm, including GF(p) over Prime fields using affine coordinates to scalar multiplication, and the scalar multiplication based on double base chain lines, the algorithm efficiency compared with Ciet, NAF classical algorithm, such as reducing the number of inversion, and Also made a lot of improvement on the algorithm itself.