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.

中文翻译：

---

SIKE 的快速有限域乘法器

最近已经提出了各种后量子密码算法。Supersingluar isogeny Diffie-Hellman 密钥交换 (SIKE) 由于其较小的密钥大小而成为最有前途的候选者之一。然而，SIKE 方案需要大量的有限域乘法来进行同构计算，因此加密和解密过程很慢。在本文中，我们提出了一种快速有限域乘法器设计，它以高吞吐量和低延迟在 GF(p) 中执行乘法。该设计采用深度流水线加速计算，通过数据交错实现高硬件利用率。所提出的有限域乘法器的吞吐量比基于相同的快速乘法算法的先前工作高 4.48 倍，并且 1.