SIKE的快速有限域乘法器
A Fast Finite Field Multiplier for SIKE
摘要:
最近提出了各种后量子密码学算法。超单密钥Diffie-Hellman密钥交换(SIKE)由于其小的密钥大小而成为最有前途的候选方案之一。然而,SIKE方案需要大量的有限域乘法来进行其isquilitary计算,因此遭受缓慢的加密和解密过程。在本文中,我们提出了一个快速有限域乘法器的设计,执行乘法在GF(p)具有高吞吐量和低延迟。该设计采用深度流水线加速计算,通过数据交织实现高硬件利用率。所提出的有限域乘法器表现出4.48倍的吞吐量比以前的工作的基础上相同的快速乘法算法和1.43倍的吞吐量比最先进的快速有限域乘法器的设计,针对SIKE。
英文摘要:
Various post-quantum cryptography algorithms have been recently proposed. Supersingluar isogeny Diffie-Hellman key exchange (SIKE) is one of the most promising candidates due to its small key size. However, the SIKE scheme requires numerous finite field multiplications for its isogeny computation, and hence suffers from slow encryption and decryption process. In this paper, we propose a fast finite field multiplier design that performs multiplications in GF(p) with high throughput and low latency. The design accelerates the computation by adopting deep pipelining, and achieves high hardware utilization through data interleaving. The proposed finite field multiplier demonstrates 4.48 times higher throughput than prior work based on the identical fast multiplication algorithm and 1.43 times higher throughput than the state-of-the-art fast finite field multiplier design aimed at SIKE.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。