Meta: A Memory-Efficient Tri-Stage Polynomial Multiplication Accelerator Using 2D Coupled-BFUs
- 24 September 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (2) , 647-660
Abstract
Polynomial multiplication (PM) is the computational bottleneck of lattice-based cryptography, such as post-quantum cryptography (PQC). Designing dedicated hardware accelerators for polynomial multiplication is an effective solution to improve the execution speed. However, current mainstream designs ignore the impact of computing array size, resulting in poor design flexibility and low memory utilization. To address these issues, we propose, a memory-efficient tri-stage PM accelerator. Our proposed tri-stage PM algorithm fuses all isolated substages into a unique stage named fused coefficient-wise multiplication (FCWM), ensuring efficient computation. Meanwhile, in different stages of the algorithm, the circuit of two-dimensional reconfigurable coupled butterfly units (2D-RCBFUs) is fine-grained reconfigured to improve resource utilization. Moreover, the low-complexity memory mapping scheme simplifies the address control logic and reduces the hardware overhead. can efficiently support the PM of an arbitrary power of two, which is impossible for previous designs using a 2D computing array. Compared with the state-of-the-art designs, our demonstrates the best memory utilization, achieving up to $10.0\times$ performance improvement.Keywords
Funding Information
- National Natural Science Foundation of China (62122023, U20A20202)
This publication has 33 references indexed in Scilit:
- A High-Performance, Conflict-Free Memory-Access Architecture for Modular Polynomial MultiplicationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023
- Area-Efficient Number Theoretic Transform Architecture for Homomorphic EncryptionIEEE Transactions on Circuits and Systems I: Regular Papers, 2022
- AC-PM: An Area-Efficient and Configurable Polynomial Multiplier for Lattice Based CryptographyIEEE Transactions on Circuits and Systems I: Regular Papers, 2022
- Scalable and Conflict-Free NTT Hardware Accelerator Design: Methodology, Proof, and ImplementationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022
- CoHA-NTT: A Configurable Hardware Accelerator for NTT-based Polynomial MultiplicationMicroprocessors and Microsystems, 2022
- Hardware Architecture of a Number Theoretic Transform for a Bootstrappable RNS-based Homomorphic Encryption Scheme2020
- Memory-Efficient High-Speed Implementation of Kyber on Cortex-M42019
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM2018
- Post-quantum cryptographyNature, 2017
- High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers2015