论文标题
快速有限的球场乘数用于Sike
A Fast Finite Field Multiplier for SIKE
论文作者
论文摘要
最近已经提出了各种量词后加密算法。 Supersingluar Isgeny Diffie-Hellman密钥交换（Sike）是最有前途的候选人之一，因为其钥匙较小。但是，囊泡方案需要许多有限的场乘法来进行其同等基础计算，因此遭受了缓慢的加密和解密过程。在本文中，我们提出了一种快速有限的场乘数设计，该设计在具有较高吞吐量和低潜伏期的GF（P）中执行乘法。该设计通过采用深层管道来加速计算，并通过数据交织来实现高硬件利用率。根据相同的快速乘法算法，提议的有限场乘数比先前的工作显示出4.48倍的吞吐量，而吞吐量的吞吐量比针对Sike的最先进的快速有限的场乘数设计高1.43倍。
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.
