隨著量子電腦的發展,傳統的密碼系統的安全性逐漸受到威脅,因此後量子密碼系統的重要性也相應提升。對於密碼系統來說,速度的快慢影響系統的安全性。更快的速度代表能在相同時間內使用更大的金鑰來進行加解密,所以如何有效實作一個密碼系統就顯得相當重要。而對於晶格密碼系統來說,多項式乘法的實作的重要性佔據了相當重要的地位。本篇論文將以NTRU Prime密碼系統在ARM Cortex-M4處理器上的實作為主軸,來探討多項式乘法在各種條件需求下的有效率的作法。
With the development of quantum computers, the security of traditional cryptosystems are under threat, so that it is important to have post-quantum cryptosystems. The speed of a cryptosystem affects its security in that a cryptosystem with higher speed can perform encryption or decryption with larger keys within the same amount of time, which means higher security. Therefore, it is important to have efficient implementations of cryptosystems. For lattice-based cryptography, the implementation of polynomial multiplication is quite important. We will discuss how to implement efficient polynomial multiplications by demonstrating the implementation of NTRU Prime cryptosystem on ARM Cortex-M4 processor in the paper.