%0 Journal Article
%T 基于Toom-Cook多项式乘法SNTRUP算法的FPGA快速实现<br>FPGA Fast Implementation Based on Toom-Cook polynomial Multiplication SNTRUP Algorithm
%A 马钰
%A 丁海洋
%A 李子臣
%J Software Engineering and Applications
%P 402-409
%@ 2325-2278
%D 2023
%I Hans Publishing
%R 10.12677/SEA.2023.123040
%X 本文设计了基于Toom-Cook多项式乘法Streamlined NTRU Prime算法的FPGA快速实现方法，Toom-Cook多项式乘法能对Streamlined NTRU Prime算法中封装以及解封装运算的多项式系数相乘进行优化，能明显减少乘法运算次数，增加Streamlined NTRU Prime算法的运算效率。在ModelSim仿真软件Intel Cyclone IV GX系列EP4CGX150DF31I7AD芯片上进行仿真实验。实验结果表明，本方案可以在封装以及解封装速度上可以提升26%。<br />
This paper designs a fast FPGA implementation method based on Toom-Book polynomial multiplication Streamlined NTRU Prime algorithm. Toom-Book polynomial multiplication can optimize the multiplication of polynomial coefficients of encryption and decryption operations in Streamlined NTRU Prime algorithm, significantly reduce the number of multiplication operations, and increase the efficiency of Streamlined NTRU Prime algorithm. The simulation experiment is carried out on the ModelSim simulation software Intel Cyclone IV GX series EP4CGX150DF31I7AD chip. The experimental results show that the encryption and decryption speed of this scheme can be improved by 26%.
%K Streamlined NTRU Prime，多项式乘法，现场可编程门阵列，后量子密码Streamlined NTRU Prime
%K Polynomial Multiplication
%K FPGA
%K Post-Quantum Cryptography
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=66870