於現場可程式化邏輯閘陣列實作後量子密碼系統關鍵元件

Abstract

後量子密碼學 (尤以格基密碼學為甚) 的計算過程經常需要快速的多項式乘法與取模運算，另外各種後量子密碼系統的向量值域範圍經常不是二的次方數，以致各種向量直接儲存傳遞時無法有效利用所有位元的消息含量。作者提出於現場可程式化邏輯閘陣列實作基於數論轉換的多項式乘法元件的暫存器傳輸級硬體之描述程式生成系統，可以自由生成基於全點型、古德三型或古德五型數論轉換的多項式乘法元件；應對各種不同模數與輸入位元數的高速取模運算元件的暫存器傳輸及硬體之描述程式生成系統；應對各種不同向量值域範圍的迪傑比編碼器，以達成各種相關運算的硬體加速。

On the Post-Quantum Cryptography, especially the Lattice-Based Cryptography, fast polynomial multiplications with fast modulo operations are necessary. Also, the range of the entries of various vectors in PQC is not necessarily the power of 2, which makes the bits saving data or being transported not information effective. The author proposed the RTL generators of polynomial multiplication with various configurations based on the implementation of the full-point NTT and/or the Good's Trick NTT (with factor 3 or 5); the RTL generators of fast arbitrary modulo operation with arbitrary input bits; the RTL implementation of DJB Codec with parameter generator, generating arbitrary configuration fitting the requirement. These designs provide the hardware acceleration of the above computation requirements for PQC.