  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.
