Post-Quantum Cryptographic Hardware Primitives

TL;DR

This paper introduces hardware-based post-quantum cryptographic primitives, including PKC, KEX, OT, and ZKP, along with a high-speed polynomial multiplier to enhance quantum-resistant secure computing systems.

Contribution

It presents a set of hardware primitives for post-quantum cryptography and a high-speed polynomial multiplier, aiding the development of quantum-proof secure systems.

Findings

Designed hardware primitives for post-quantum cryptography

Implemented a high-speed polynomial multiplier

Facilitates construction of quantum-resistant secure systems

Abstract

The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years. In this work, we introduce a set of hardware post-quantum cryptographic primitives (PCPs) consisting of four frequently used security components, i.e., public-key cryptosystem (PKC), key exchange (KEX), oblivious transfer (OT), and zero-knowledge proof (ZKP). In addition, we design a high speed polynomial multiplier to accelerate these primitives. These primitives will aid researchers and designers in constructing quantum-proof secure computing systems in the post-quantum era.