计算机科学
数据流
并行计算
延迟(音频)
密码学
多项式的
算术
乘法(音乐)
符号
反向
离散数学
数学
算法
组合数学
数学分析
电信
几何学
作者
Zewen Ye,Ray C. C. Cheung,Kejie Huang
出处
期刊:IEEE Transactions on Circuits and Systems Ii-express Briefs
[Institute of Electrical and Electronics Engineers]
日期:2022-06-21
卷期号:69 (10): 4068-4072
被引量:51
标识
DOI:10.1109/tcsii.2022.3184703
摘要
Polynomial multiplication is the key and time-consuming operation among various operators in Post-Quantum Cryptography (PQC), which aims to find quantum-resistant algorithms to prevent attacks launched by quantum computers. Number Theoretic Transform (NTT) is an efficient algorithm that can accelerate the polynomial multiplication from $\mathcal {O}(n^{2})$ to $\mathcal {O}(nlog(n))$ . In this brief, we present a pipelined NTT (PipeNTT) hardware architecture in FPGA to achieve high throughput with fewer hardware resources. The dataflow and the butterfly unit are optimized to minimize the latency. To fulfil the proposed dataflow, a Block RAM (BRAM) based reordering unit is designed to further reduce the hardware resource. Moreover, our architecture can also be applied to Inverse-NTT (INTT). Compared to state-of-the-art parallel designs, our design achieves a 30% lower area-time product with 3x less memory space requirement.
科研通智能强力驱动
Strongly Powered by AbleSci AI