Abstract:

Elliptic curve scalar multiplication is the main computing process in Elliptic Curve Cryptography (ECC), and the efficiency and security of scalar multiplication is always the research hotspot. Aiming at the problem that elliptic curve scalar multiplication has a tremendous computation and is vulnerable to power analysis attacks, a fast sliding window algorithm against power analysis attacks is proposed. In Jacobian and Affine mixed coordinates, the signed sliding window algorithm strategy is used to perform elliptic curve scalar multiplication, and random keys method is applied against power analysis attacks. The analysis results show that, compared with binary expansion method and key assignment method, the improved signed sliding window scalar multiplication algorithm improves calculation efficiency and antiattack performance significantly.

Key words: elliptic curve cryptography;scalar multiplication;power analysis attack;sliding window algorithm;mixed coordinates