后量子密码学
计算机科学
密码系统
量子计算机
基于格的密码学
数字签名
密码学
NIST公司
公钥密码术
整数分解
计算机工程
离散对数
二锂
密码分析
现场可编程门阵列
NTRU
理论计算机科学
嵌入式系统
量子
加密
算法
量子密码学
量子信息
计算机安全
散列函数
离子
量子力学
物理
脱质子化
自然语言处理
作者
Luke Beckwith,Duc Tri Nguyen,Kris Gaj
标识
DOI:10.1109/icfpt52863.2021.9609917
摘要
Many currently deployed public-key cryptosystems are based on the difficulty of the discrete logarithm and integer factorization problems. However, given an adequately sized quantum computer, these problems can be solved in polynomial time as a function of the key size. Due to the future threat of quantum computing to current cryptographic standards, alternative algorithms that remain secure under quantum computing are being evaluated for future use. One such algorithm is CRYSTALS-Dilithium, a lattice-based digital signature scheme, which is a finalist in the NIST Post Quantum Cryptography (PQC) competition. As a part of this evaluation, high-performance implementations of these algorithms must be investigated. This work presents a high-performance implementation of CRYSTALS-Dilithium targeting FPGAs. In particular, we present a design that achieves the best latency for an FPGA implementation to date. We also compare our results with the most-relevant previous work on hardware implementations of NIST Round 3 post-quantum digital signature candidates.
科研通智能强力驱动
Strongly Powered by AbleSci AI