Multiplying unit on finite field GF (2 227) and modular multiplication algorithm

Abstract

The invention discloses a multiplying unit on a finite field GF (2 227) and a modular multiplication algorithm, and belongs to the technical field of the encryption and decryption of data information. The multiplying unit comprises a partial product overlapping module, a first register, a first accumulation module, a second register, a second accumulation module, a third register, a modular addition module and a fourth register. A multiply operation unit 227*57 is reused by the modular multiplication algorithm, a modular multiplication module of which m is equal to 227 applied to an ECC (Elliptic Curve Cryptography) system of which the bit width m is equal to 226 is provided; when m is equal to 226, an AOP (All One Polynomial) type reduction polynomial is generated, and the redundant of an operand is represented by a formula that m is equal to 227, therefore the reduction polynomial can be simplified, and the modular multiplication performance can be improved; furthermore, the registers are inserted into the partial product overlapping part, and a path for modular multiplication can be cut off, therefore the length of a critical path can be reduced, the modular multiplication can be executed in a streamline way, the clock frequency can be improved, the processing speed and data throughout can be improved, and resource saving can be realized.

Description

technical field [0001] The invention discloses a multiplier and a modular multiplication algorithm on a finite field GF (2^227), and belongs to the technical field of data information encryption and decryption. Background technique [0002] With the rapid development of information technology, with the popularization and wide application of the network, more and more data circulated on the network, and people have higher and higher requirements for the security of data transmission on the network, so for The study of network security poses great challenges, so cryptography is now at the heart of information security. In cryptography, public-key cryptography has been widely studied and used. In the research of public-key cryptography, a more resource-saving cryptosystem with higher encryption and decryption efficiency was proposed, that is, elliptic curve cryptography. [0003] In 1985, Neal Koblitz and Victor Miller proposed Elliptic Curve Cryptography (Elliptic Curve Crypt...

AI Technical Summary

Problems solved by technology

[0005] The technical problem to be solved by the present invention is to provide the multiplier and the modular multiplication algorithm on the finite field GF (2^227) for the deficiency of above-mentioned background technology, has proposed the AOP (All One Polynomial, a Polynomial) type reduction polynomial, realizes the operand modular multiplication operation in the ECC system with the highest bit width of 226bit, and solves the existing technical problem of large resource consumption of modular multiplication

Images