Binary field bit-width-variable modular multiplication operator

Abstract

The invention discloses a modular multiplication operator implemented by a series-parallel combination way, and belongs to the field of elliptic curve cryptography algorithms. The binary field bit-width-variable modular multiplication operator comprises a partial product multiplication unit, a word level multiplication unit, an output cache unit, a data shifting unit and a control unit. The modular multiplication operator is based on a polynomial basis under a binary field; input data are read in an MSB-first (Most Significant Bit first) way; the step number of loop computing is controlled according to computing digits by a state machine; a word multiplication operation and a partial multiplication operation are performed concurrently in the steps; and lastly, computing results in all the steps are integrated, and output in series. The operating rate is increased in the series-parallel combination way, and the computing complexity is lowered. Meanwhile, a bit multiplier capable of computing data of a plurality of bit widths is designed internally, so that reutilization of a hardware structure is realized. Compared with the prior art, the modular multiplication operator is more advantageous on the aspects of area, flexibility and the like, and a relatively high operation rate is ensured at the same time.

Description

technical field [0001] The invention relates to the hardware realization field of an elliptic curve encryption (ECC) algorithm, in particular to a low-level modular multiplication operator capable of calculating data with different bit widths under a binary domain polynomial basis. Background technique [0002] In the field of information security, more and more information is exchanged in open media. In order to ensure the security and confidentiality of information exchange, various cryptography was born and widely used in the field of wireless network communication. Currently, the commonly used public key cryptographic algorithms are RSA and elliptic curve cryptographic algorithms. The security foundation of the elliptic curve cryptography algorithm is built on the difficulty of the elliptic curve discrete logarithm problem (ECDLP), which has a completely exponential computational complexity. Moreover, 160-bit ECC can provide a security strength equivalent to 1024-bit RS...

AI Technical Summary

Problems solved by technology

In the past technology, for different bit widths, it is necessary to design different hardware circuits to adapt to the bit width, which will cause a lot of waste of resources on the hardware circuit, and at the same time, an excessively large area will also cause line delays. affect overall performance

Images