Number-theory conversion device

Abstract

The invention discloses a number theory conversion device which comprises an input control unit, a twiddle factor generation unit, a main operation unit and an output control unit. Wherein the input control unit is connected with the main operation unit and is used for realizing data transmission; the twiddle factor generation unit is connected with the main operation unit and is used for synchronizing with the main operation unit through a handshake signal and generating a twiddle factor required by each stage in the calculation of the main operation unit; the main operation unit is provided with a butterfly calculation unit and is used for realizing data flow modular multiplication calculation of each stage through butterfly calculation; and the output control unit is connected with the main operation unit and is used for converting and outputting the data stream bit width and the clock domain of the to-be-output data result according to the requirements of a post-stage module. According to the method, the operation parallelism is improved, the average calculation time of a number theory conversion device is shortened, and the system processing capacity is improved.

Description

technical field [0001] The invention relates to the field of circuit realization of information security algorithms, in particular to a number theory transformation device. Background technique [0002] The development of quantum computers has made post-quantum encryption algorithms, that is, encryption algorithms that can be implemented on traditional computers and can resist quantum computing attacks, attract a lot of attention. Lattice-based encryption algorithm has strong security and can be applied to key exchange, digital signature and fully homomorphic encryption. Compared with the Fourier transform, the number theoretic transforms (NTT) do not involve precision and floating-point numbers when calculating the polynomial multiplication, which can significantly reduce the circuit area and is easy to implement. However, the existing number-theoretic transformations can only implement operations under a single module and a single number of data, which limits its applicat...

AI Technical Summary

Problems solved by technology

[0008] NTT reduces the operational complexity of polynomial multiplication from the N^2 level to the NlogN level. On the premise of not requiring the particularity of the input data, the computational complexity cannot be further reduced theoretically.

However, due to the nature requirements of the NTT algorithm, there is a time interval between data handling and storage between each processing stage, which affects the calculation efficiency.

Images