Improving scalar multiplication over elliptic curves
Siham Ezzouak, Abdelmalek Azizi
Abstract
Siham Ezzouak, Abdelmalek Azizi
Abstract
The elliptic curves scalar multiplication has been paid much attention in the recent years, and one of major interests in this field is to improve algorithm for elliptic curve cryptosystem. In this paper, we give detailed study of the efficiency issues in scalar multiplication on the elliptic curves. In particular, we present the cost of group operation in several coordinate system and bases representation. Moreover, we show that more optimization can be achieved when better combination of coordinate choise and bases representation are performed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The elliptic curves scalar multiplication has been paid much attention in the recent years, and one of major interests in this field is to improve algorithm for elliptic curve cryptosystem. In this paper, we give detailed study of the efficiency issues in scalar multiplication on the elliptic curves. In particular, we present the cost of group operation in several coordinate system and bases representation. Moreover, we show that more optimization can be achieved when better combination of coordinate choise and bases representation are performed.
Key concepts: Scalar multiplication, Elliptic curve point multiplication, Elliptic curve, Scalar (mathematics), Elliptic curve cryptography, Hessian form of an elliptic curve, Representation (politics), Schoof's algorithm