A Lightweight and Efficient Schoolbook Polynomial Multiplier for Saber
Authors:
- 28 May 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2251-2255
Abstract
Saber is a lattice-based post-quantum cryptography (PQC) algorithm, which is still a candidate in the 3 rd Round of National Institute of Standards and Technology (NIST) PQC standardization process. Saber provides a great advantage of being lightest among all the candidates, so a suitable choice for resource-constraint platforms. Polynomial multiplication occupies most of the resources in hardware implementation of Saber, which needs to be optimized for the efficient hardware implementation. In this work, a lightweight and efficient schoolbook polynomial multiplier is proposed. The architecture includes an efficient multiplication strategy that compute four coefficient-wise multiplication per cycle along with the multiplication operand loading technique being designed for the compact multiplier. The proposed multiplier on Artix-7 FPGA, achieves a frequency of 130 MHz and fits into 201 slices. Compared with the state-of-the-art lightweight schoolbook implementations for Saber, our design has a 30% improved frequency and saves 15.8% of the clock counts at the cost of only 3.7% more LUTs.Keywords
Funding Information
- National Natural Science Foundation of China
- Natural Science Foundation of Jiangsu Province
- Engineering and Physical Sciences Research Council
This publication has 12 references indexed in Scilit:
- LWRpro: An Energy-Efficient Configurable Crypto-Processor for Module-LWRIEEE Transactions on Circuits and Systems I: Regular Papers, 2021
- High-speed Instruction-set Coprocessor for Lattice-based Key Encapsulation Mechanism: Saber in HardwareIACR Transactions on Cryptographic Hardware and Embedded Systems, 2020
- Compact domain-specific co-processor for accelerating module lattice-based KEM2020
- An Efficient and Parallel R-LWE CryptoprocessorIEEE Transactions on Circuits and Systems II: Express Briefs, 2020
- Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptographyIACR Transactions on Cryptographic Hardware and Embedded Systems, 2020
- Saber on ARMIACR Transactions on Cryptographic Hardware and Embedded Systems, 2018
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms2016
- Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithm2014
- Elliptic Curve Cryptography and its applications2011
- Algorithms for quantum computation: discrete logarithms and factoring2002