Post-Quantum Cryptographic Hardware Primitives

2019/03/09 by Lake Bu, Rashmi Agrawal, Bu, Lake +5
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Quantum Computing Algorithms and Architecture

paper · pdf · doi:10.48550/arxiv.1903.03735

openalex publication_date 2019/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

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.

Related

• Post-Quantum Cryptography: Securing Digital Communication in the Quantum Era
• Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research
• Post-Quantum Cryptography Algorithms Standardization and Performance Analysis
• REPQC: Reverse Engineering and Backdooring Hardware Accelerators for Post-quantum Cryptography
• Quantum-Resistant Cryptography