Performance and Efficiency Exploration of Hardware Polynomial Multipliers for Post-Quantum Lattice-Based Cryptosystems
Open Access
- 20 January 2024
- journal article
- research article
- Published by Springer Nature in SN Computer Science
- Vol. 5 (2) , 1-19
Abstract
The significant effort in the research and design of large-scale quantum computers has spurred a transition to post-quantum cryptographic primitives worldwide. The post-quantum cryptographic primitive standardization effort led by the US NIST has recently selected the asymmetric encryption primitive Kyber as its candidate for standardization and indicated NTRU, as a valid alternative if intellectual property issues are not solved. Finally, a more conservative alternative to NTRU, NTRUPrime was also considered as an alternate candidate, due to its design choices that remove the possibility for a large set of attacks preemptively. All the aforementioned asymmetric primitives provide good performances, and are prime choices to provide IoT devices with post-quantum confidentiality services. In this work, we present a comprehensive exploration of hardware designs for the computation of polynomial multiplications, the workhorse operation in all the aforementioned cryptosystems, with a thorough analysis of performance, compactness and efficiency. The presented designs cope with the differences in the arithmetics of polynomial rings employed by distinct cryptosystems, benefiting from configurations and optimizations that are applicable at synthesis time and/or run time. In this context, we target a use case scenario where long-term key pairs are used, such as the ones for VPNs (e.g., over IPSec), secure shell protocols and instant messaging applications. Our high-performance design variants exhibit figures of latency comparable to the ones needed for the execution of the symmetric cryptographic primitives also included in the Post-Quantum schemes. Notably, the performance figures of the designs proposed for NTRU and NTRU Prime surpass the ones described in the related literature.Keywords
Funding Information
- Politecnico di Milano
This publication has 12 references indexed in Scilit:
- An Efficient Unified Architecture for Polynomial Multiplications in Lattice-Based Cryptoschemes2023
- Streamlined NTRU Prime on FPGAJournal of Cryptographic Engineering, 2022
- Status report on the third round of the NIST Post-Quantum Cryptography Standardization process2022
- Optimized Polynomial Multiplier Architectures for Post-Quantum KEM Saber2021
- A Constant Time Full Hardware Implementation of Streamlined NTRU Prime2021
- Evaluating the Potential for Hardware Acceleration of Four NTRU-Based Key Encapsulation Mechanisms Using Software/Hardware Codesign2019
- Efficient architecture and implementation for NTRUEncrypt system2015
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 02007
- The Secure Shell (SSH) Authentication Protocol2006
- Exponentiation cryptosystems on the IBM PCIBM Systems Journal, 1990