Verification of an Optimized NTT Algorithm
Verification of an Optimized NTT Algorithm
复制标题
优化NTT算法的验证
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Ian A. Mason
中科院分区：
文献类型：
--
作者：
J. Navas;B. Dutertre;Ian A. Mason
数论变换(NTT)是计算有限域上系数多项式乘积的有效算法。这是基于格的密钥交换和签名方案中的一个常见过程。这些新的密码算法正变得越来越重要，因为它们是量子抵抗的。与RSA或椭圆曲线密码系统等较老的方案不同，目前还没有量子算法可以打破这些基于格子的算法。
The Number Theoretic Transform (NTT) is an efficient algorithm for computing products of polynomials with coefficients in finite fields. It is a common procedure in lattice-based key-exchange and signature schemes. These new cryptographic algorithms are becoming increasingly important because they are quantum resistant. No quantum algorithm is known to break these lattice-based algorithms, unlike older schemes such as RSA or elliptic curve cryptosystems.