Post-Quantum Cryptographic Hardware Primitives
This work addresses the pressing issue of quantum-resistant cryptography for secure computing systems, though it appears incremental as it builds on existing cryptographic components.
The paper tackles the need for secure computing systems in the post-quantum era by introducing a set of hardware post-quantum cryptographic primitives (PCPs) and a high-speed polynomial multiplier to accelerate them, aiming to aid researchers and designers in building quantum-proof systems.
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.