High-speed multiple-point operation method for elliptic curve passwords

Abstract

The invention discloses a high-speed multiple-point operation method for elliptic curve passwords, which is realized by adopting an assembly line type Montgomery modular multiplier matched with an adder, executing N clock periods by one modular multiplier to obtain a result, and sending N different operations to the modular multiplier in N continuous clock periods; and in the previous clock periodof the first operation result, sending the input of the Nth operation into the modular multiplier. The invention utilizes the flow characteristics of the pipelined Montgomery modular multiplier, subtly multiplexes the underlying pipelined hardware circuit, and simultaneously performs multiple multiplication operations in a batch manner, and the throughput of a whole system is improved by severalorders of magnitude.Therefore, the performance / hardware resource ratio and the performance / energy consumption ratio are improved by several times or even dozens of times compared with those in the prior art. Meanwhile, the optimal number of Montgomery modular multipliers and modular adders is selected by analyzing the characteristics of a multiple point algorithm, and the optimal configuration ofperformance 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 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 elliptic curve ...

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 the cost performance of the system and an increase in energy consumption, such as figure 1 The hardware timing of the non-pipelined doubling point shown in

Images