Article
Version 1
This version is not peer-reviewed
Designing a Scalable and Area-Efficient Hardware Accelerator Supporting Multiple PQC Schemes
and
*
Version 1
: Received: 1 July 2024 / Approved: 1 July 2024 / Online: 1 July 2024 (08:10:41 CEST)
How to cite: Jung, H.; Oh, H. Designing a Scalable and Area-Efficient Hardware Accelerator Supporting Multiple PQC Schemes. Preprints 2024, 2024070039. https://doi.org/10.20944/preprints202407.0039.v1 Jung, H.; Oh, H. Designing a Scalable and Area-Efficient Hardware Accelerator Supporting Multiple PQC Schemes. Preprints 2024, 2024070039. https://doi.org/10.20944/preprints202407.0039.v1
Abstract
This study introduces a hardware accelerator to support various Post-Quantum Cryptosystem (PQC) schemes, addressing the quantum computing threat to cryptographic security.
PQCs, while more secure, also bring significant computational demands, especially problematic for lightweight devices.
Previous hardware accelerators are typically scheme-specific, which is inefficient given the National Institute of Standards and Technology (NIST)'s multiple finalists.
Our approach focuses on the shared operations among these schemes, allowing a single design to accelerate multiple candidate PQCs at the same time.
This is further enhanced by allocating resources according to performance profiling results.
Our compact, scalable hardware accelerator supports four of NIST PQC finalists, achieving an area efficiency of up to 81.85\% compared to the current state-of-the-art multi-scheme accelerator while supporting twice as many schemes.
The design demonstrates average throughput improvements ranging from 0.97$\times$ to 35.97$\times$ across the four schemes and their main operations, offering an efficient solution for implementing multiple PQC schemes within constrained hardware environments.
Keywords
Post-Quantum Security; Kyber-Dilithium; Falcon; SPHINCS+; Hardware Accelerator
Subject
Computer Science and Mathematics, Hardware and Architecture
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
