Reliable CRC-Based Error Detection Constructions for Finite Field Multipliers With Applications in Cryptography
Reliable CRC-Based Error Detection Constructions for Finite Field Multipliers With Applications in Cryptography
复制标题
DOI：
10.1109/tvlsi.2020.3031170
复制
发表时间：
2021-01-01
影响因子：
2.8
通讯作者：
Azarderakhsh, Reza
中科院分区：
文献类型：
--
作者：
Canto, Alvaro Cintas;Mozaffari-Kermani, Mehran;Azarderakhsh, Reza
有限场乘法已在文献中引起了广泛的关注，并在加密和检测码中应用了应用。对于许多加密算法，这种算术操作是一项复杂，昂贵且耗时的任务，可能需要数百万个大门。在这项工作中，我们提出了基于循环冗余检查（CRC）的有效硬件体系结构，作为Quantum加密后（PQC）的错误检测方案（PQC），以及LUOV加密算法的案例研究。卢夫（Luov）被提交给国家标准技术研究所（NIST）PQC标准化竞赛，并晋级第二轮。所选的CRC多项式与所需的误差检测功能以及场大小也内在。我们已经开发了验证代码，通过该代码，通过其中执行提出的方案的软件实现来验证配方的推导。此外，使用建议的错误检测方案的原始乘数的硬件实现是通过Xilinx野外可编程栅极阵列（FPGA）执行的，从而验证了所提出的方案是否实现了可接受的高误差，并且可接受的开销。
Finite-field multiplication has received prominent attention in the literature with applications in cryptography and error-detecting codes. For many cryptographic algorithms, this arithmetic operation is a complex, costly, and time-consuming task that may require millions of gates. In this work, we propose efficient hardware architectures based on cyclic redundancy check (CRC) as error-detection schemes for postquantum cryptography (PQC) with case studies for the Luov cryptographic algorithm. Luov was submitted for the National Institute of Standards and Technology (NIST) PQC standardization competition and was advanced to the second round. The CRC polynomials selected are in-line with the required error-detection capabilities and with the field sizes as well. We have developed verification codes through which software implementations of the proposed schemes are performed to verify the derivations of the formulations. Additionally, hardware implementations of the original multipliers with the proposed error-detection schemes are performed over a Xilinx field-programmable gate array (FPGA), verifying that the proposed schemes achieve high error coverage with acceptable overhead.