Sparse Polynomial Multiplication-Based High-Performance Hardware Implementation for CRYSTALS-Dilithium
Authors:
- 6 May 2024
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 150-159
Abstract
CRYSTALS-Dilithium has been declared as the first recommended digital signature algorithm in NIST Post-Quantum Cryptography Standardization. The advancement of high-speed hardware research for Dilithium is propelled by the need for real-time processing of extensive data in numerous digital signature applications. To address the slow signature generation speed issue, a two-stage pipeline structure was developed to accelerate the underlying rejection loop, at a cost of substantial resource consumption. In this paper, we present the first analysis on the possibility of leveraging sparse multiplication in the second stage, which can reduce the bit complexity of corresponding multiplications by over 85% and lower the storage requirements for the secret key by over 68%. Building on this, we propose a sparse computing core and a high-speed hybrid architecture for Dilithium, with an efficient scheduling mechanism and optimized modules. Compared to state-of-the-art high-speed implementations on similar platforms, the signature generation speed is at least 2x faster. Meanwhile, the area-time-products of signature generation achieve 3.6x/4.3x/2.0x/2.1x improvement in terms of LUT/FF/DSP/BRAM, respectively.Keywords
This publication has 23 references indexed in Scilit:
- A Hard Crystal - Implementing Dilithium on Reconfigurable Hardware2022
- High-Performance Hardware Implementation of CRYSTALS-Dilithium2021
- A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model2018
- Worst-case to average-case reductions for module latticesDesigns, Codes and Cryptography, 2014
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware2014
- Use of Digital Signature with Diffie Hellman Key Exchange and AES Encryption Algorithm to Enhance Data Security in Cloud Computing2013
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures2009
- Algorithms for quantum computation: discrete logarithms and factoring2002
- Digital signatures for flows and multicasts2002
- A new approach to pipeline FFT processor1996