High-speed point addition operation method and device for elliptic curve password

Abstract

The invention discloses a high-speed point addition operation method and a device for elliptic curve cryptography, which are realized by matching a pipelined Montgomery modular multiplier with a modular adder, and 16 modular multiplication operations are executed by one point addition operation; according to the point addition circuit using one or more modular multipliers, each modular multiplication operation executes an operation request of one batch, and the system can calculate N operations at the same time, so that the overall performance of the system is improved by N times. According tothe method, the pipelined characteristics of the pipelined Montgomery modular multiplier are utilized, a bottom pipelined hardware circuit is ingeniously multiplexed, multiple point addition operations are executed at the same time in a batch processing mode, and the throughput of the whole system is improved by several orders of magnitudes. Therefore, the performance / hardware resource ratio andthe performance / energy consumption ratio of the method are improved by several times or even dozens of times compared with those of the prior art. Meanwhile, the optimal number of Montgomery modular multipliers and modular adders is selected by analyzing the characteristics of the point addition algorithm, and the optimal configuration of performance and resource use is achieved.

Description

technical field [0001] The invention relates to the technical field of elliptic curve cryptography systems, in particular to a high-performance integrated circuit method and device for doubling points of elliptic curve cryptography. Background technique [0002] Information security is based on security algorithms, and one type of security algorithms is asymmetric key algorithms. The advantage of the asymmetric key algorithm is high security, but the disadvantage is that the encryption speed is much slower than the block cipher, so people have been studying how to improve the operation speed of the asymmetric key algorithm. At present, there are mainly two types of asymmetric key algorithms, one is RSA, and the other is Elliptic Curve Cryptography (ECC). [0003] Elliptic Curve Cryptography (ECC) was proposed by N.Koblitz and V.Miller in 1985. It is a kind of cryptographic system obtained by replacing the finite cyclic group in the discrete logarithm problem with the ellipt...

AI Technical Summary

Problems solved by technology

But this method also has its limitations, because many modular multiplication operations have certain data dependencies, and they cannot be completely parallelized.

At the same time, this method needs to use more than double the hardware resources every time the performance is doubled, resulting in a decrease in system cost performance and an increase in energy consumption.

Images