Prime field elliptic curve crypto dot product accelerating circuit

Abstract

The invention relates to a prime field elliptic curve crypto dot product accelerating circuit, which is used for calculating a formula that Q is equal to k*P, wherein the k is times for calculating dot product; the P is a point on an elliptic curve, and the Q is the other point on the elliptic curve. The prime field elliptic curve crypto dot product accelerating circuit comprises an initialization register, a point addition operation module, a point subtraction operation module, a multiple point operation module, a shifting register, a comparator, an alternative selector and a result register, wherein the point addition operation module, the point subtraction operation module, the multiple point operation module and the shifting register are in parallel execution. According to the prime field elliptic curve crypto dot product accelerating circuit, the operation times for point addition and multiple point are controlled through carrying out right shift operation on NAF (k) and judging whether the NAF (k) is '0' or not, wherein the NAF (k) is a non-adjacent expression type numerical value of the k. When a value of the k is '0', the point addition operation can be stopped automatically, so that the operation time is saved. The accelerating circuit is more flexible than regular execution of 2m times of point operation, only a 2m-bit shifter and a corresponding control circuit are needed when an algorithm realizes point multiplication operation of any bit length, the resource demand is less, and the accelerating circuit is suitable to be realized in an FPGA (Field Programmable Gate Array) or an ASIC (Application Specific Integrated Circuit).

Description

Technical field [0001] The invention provides a point product acceleration circuit hardware structure of a prime domain elliptic curve encryption algorithm, which belongs to the field of hardware acceleration for complex calculations. Background technique [0002] Elliptic Curve Cryptography (ECC) was proposed by N. Koblitz and V. Miller in 1985. Elliptic curve cryptography is a public key cryptosystem. Its security is based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP). The best algorithm for solving ECDLP now has full exponential time complexity, which means that With the desired degree of security, elliptic curve ciphers can use shorter keys than RSA ciphers. Due to the short key, elliptic curve encryption and decryption are not only fast, but also save energy, bandwidth and storage space. [0003] Specific to the entire calculation process of the elliptic curve encryption algorithm, the point multiplication operation is the most time-consuming par...

AI Technical Summary

Problems solved by technology

[0004] The present invention aims at the problem of low efficiency of dot multiplication in traditional hardware or software algorithms, and provides a dot multiplication acceleration circuit structure, which can significantly increase the speed of dot multiplication and reduce hardware resource usage

Images