Multiple computing circuit for ellipic curve cipher algorithm chip

Abstract

This invention discloses a double point computation circuit used for elliptic curve code algorithmic chip. Its characteristics rely in: a control module used for separation of big integer K value, pre-computation and logical control, double point module and the dot piling module; the control module separates the big integer K value into m small integer Ki, and pre-computes the corresponding point Pi integrated to point P; then under the logical control of the control module, respectively carry out double point calculation in the corresponding m double point modules, send the calculated value to the dot-piling module to implement dot-piling computation, and output big integer K and the dot-piling computation value of the point P. This m circuits paralleled dot-piling computation circuit has apparent effect on the improvement of the performance, and m circuits paralleled computation performance is as m times as that of the mono-way serial double-point computation. Because the double-point computation takes up 95% time of the whole elliptic curve code algorithm, so the improvement multiple of the whole elliptic curve code algorithmic chip is m.

Description

technical field [0001] The invention relates to a doubling operation circuit for an elliptic curve encryption algorithm chip. Background technique [0002] Elliptic curve cryptography is a public key cryptography algorithm. The elliptic curve cryptographic algorithm includes a point P multiplied by a large integer K, that is, the point multiplication operation, referred to as K*P. In the operation process of the elliptic curve cryptographic algorithm, the doubling point operation accounts for most of the time. Therefore, the decisive factor that affects the performance of the elliptic curve cryptographic algorithm chip or the operation rate is the circuit that realizes the doubling operation. [0003] The doubling point operation refers to the multiplication of a point P on the elliptic curve by a large integer K, which is similar to the K-th power calculation of an element on the multiplicative group of a finite field. The standard algorithm for this operation is the bin...

AI Technical Summary

Problems solved by technology

The above optimization scheme has improved the operation rate of the elliptic curve cryptographic algorithm chip to a certain extent, but still cannot fully meet the requirements of high-speed chip implementation of the elliptic curve cryptographic algorithm

Images