Polynomial modular multiplication coprocessor based on lattice-based cryptosystem

Abstract

A polynomial modular multiplication coprocessor based on a lattice-based cryptosystem comprises a first register file, a second register file, a third register file and a fourth register file, and further comprises a multiplexer, an input register file, a fast Fourier transform module and an output register file, wherein the input end of the multiplexer is connected with the third register file, the fourth register file and the output of a modular multiplication inverse element operation unit; the input register file is connected with the multiplexer and an address mapping table; the fast Fourier transform module is connected with the input register file and the output end of the first register file under modular computation; the input end of the output register file is connected with the output end of the fast Fourier transform module under modular computation, and the output end of the output register file is connected with the multiplexer; the output end of a demultiplexer is connected with an output end and a modular multiplication unit, and the output end of the modular multiplication unit is connected with the modular multiplication inverse element operation unit; the input end of the address mapping table is connected with the second register file. According to the coprocessor, an FPGA platform is used for hardware design, and the polynomial modular multiplication coprocessor based on the lattice-based cryptosystem is obtained.

Description

technical field [0001] The invention relates to a polynomial modular multiplication coprocessor. In particular, it relates to a polynomial modular multiplication coprocessor based on a lattice cryptosystem. Background technique [0002] Public key cryptography is the main means to ensure information security in e-commerce and e-government. Constructing a public key cryptosystem based on large integer factorization and discrete logarithm difficulty is the current mainstream public key cryptosystem, such as: RSA cryptosystem. However, these cryptosystems all contain complex mathematical operations, which still restrict the development of these public key cryptosystems, such as: elliptic curve cryptosystem, bilinear pairing cryptosystem. In addition, factorization of large integers and discrete logarithm problems have been proved to be unable to resist quantum attacks and sub-exponential attacks. Therefore, it is necessary to seek a more efficient and secure public-key crypt...

AI Technical Summary

Problems solved by technology

However, these cryptographic systems contain complex mathematical operations, which still restrict the development of these public key cryptosystems, such as: elliptic curve cryptosystem, bilinear pairing cryptosystem

In addition, large integer factorization and discrete logarithm problems have been proved to be unable to resist quantum attacks and sub-exponential attacks

Images