An Efficient and Parallel R-LWE Cryptoprocessor
- 12 March 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 67 (5) , 886-890
Abstract
Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which allows for more efficient implementation while maintaining the hardness of an original problem. Polynomial multiplication is the bottleneck of R-LWE, that can either be done using Number Theoretic Transform (NTT) or schoolbook polynomial multiplication (SPM) algorithm. The use of SPM is wider and possible for all parameters of R-LWE schemes. This work proposes an efficient and parallel strategy for SPM in R-LWE; by successfully reducing its time complexity from n2 to n2/4 (making it 1.8× faster and 1.4× hardware efficient). Furthermore, by adjusting the bit width for the error terms, the polynomial multiplication and addition blocks are reused for both encryption and decryption modules resulting in 14% reduced area and 1.7× better throughput in comparison to state-of-art SPM based R-LWE designs.Keywords
Funding Information
- National Natural Science Foundation of China (61871216, 61771239)
- Fundamental Research Funds for the Central Universities China (NE2019102)
- Six Talent Peaks Project in Jiangsu Province (2018XYDXX-009)
This publication has 12 references indexed in Scilit:
- Efficient-Scheduling Parallel Multiplier-Based Ring-LWE CryptoprocessorsElectronics, 2019
- Lightweight Hardware Implementation of R-LWE Lattice-Based Cryptography2018
- Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography2018
- High-Throughput Ring-LWE CryptoprocessorsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2017
- On Practical Discrete Gaussian Samplers for Lattice-Based CryptographyIEEE Transactions on Computers, 2016
- Efficient Ring-LWE Encryption on 8-Bit AVR Processors2015
- Area optimization of lightweight lattice-based encryption on reconfigurable hardware2014
- Low-cost and area-efficient FPGA implementations of lattice-based cryptography2013
- Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware2012
- Algorithms for quantum computation: discrete logarithms and factoring2002