Scalar multiplication algorithm based on wNAF improvement

Abstract

The invention relates to a scalar multiplication algorithm based on wNAF improvement. The invention provides an algorithm for reducing the complexity of elliptic curve scalar multiplication calculation, which comprises the following steps of: 1, inputting a scalar k and a window width w; step 2, pre-calculating {20P, 21P,..., 2wP} and {3P, 5P,..., (2w-2-1) P}; 3, determining values in the k chain by using a wNAF algorithm, judging whether the remainder of k to 2 is 0, if so, ei = 0, if not, ei = k mod 2w + 1, judging whether ei is greater than 2w, if so, ei = ei-2w + 1, k = k-ei and k = k / 2, ending the operation of this round, and continuously judging whether the remainder of k to 2 is 0 in the next round until the whole k chain is obtained; and 4, performing scalar multiplication calculation Q = k * P through the k chain obtained in the step 3 to obtain scalar multiplication Q. Compared with a wNAF scalar multiplication algorithm, the algorithm not only reduces the number of pre-calculations, but also reduces the calculation complexity, and facilitates the effective implementation of an elliptic curve cryptosystem.

Description

technical field [0001] The scalar multiplication algorithm involved in the present invention is an algorithm that can reduce the computational complexity of scalar multiplication. Background technique [0002] The main advantage of Elliptic Curve Cryptography (ECC) is the small key size, replacing the 1024-bit key of RSA with a 160-bit key, and providing the same level of security, ECC also has outstanding advantages such as low power consumption and fast calculation speed, It is especially suitable for WSN, PDA and other environments with limited processing power, storage space, bandwidth, and power consumption. [0003] In recent years, many researchers in the field of cryptography have been very interested in elliptic curve scalar multiplication over finite fields, and the main research direction is to understand how elliptic curve cryptography is implemented and how to reduce its complexity. Among them, the most widely studied is the wNAF algorithm. Although this method...

AI Technical Summary

Problems solved by technology

Among them, the most widely studied is the wNAF algorithm. Although this method reduces the computational complexity, the precomputation consumes too many resources and is not suitable for large windows.

Images