Lightweight Hardware Implementation of R-LWE Lattice-Based Cryptography

Lattice based cryptography (LBC) is one of the most promising post-quantum cryptographic candidates. Ring-learning with errors (R-LWE) is an encryption scheme of LBC. In this paper, a lightweight hardware implementation is presented including key generation, encryption, and decryption. The R-LWE enc...

Full description

Saved in:
Bibliographic Details
Published in2018 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) pp. 403 - 406
Main Authors Fan, Sailong, Liu, Weiqiang, Howe, James, Khalid, Ayesha, O'Neill, Maire
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2018
Subjects
cumulative distribution table
Encryption
Field programmable gate arrays
FPGA
Hardware
lattice-based cryptography
polynomial multiplication
Public key
Quantum computing
Random access memory
ring-learning with errors
Online AccessGet full text

Cover

More Information
Summary:Lattice based cryptography (LBC) is one of the most promising post-quantum cryptographic candidates. Ring-learning with errors (R-LWE) is an encryption scheme of LBC. In this paper, a lightweight hardware implementation is presented including key generation, encryption, and decryption. The R-LWE encryption scheme consists of a Gaussian sampler and polynomial multiplication. This paper uses cumulative distribution table (CDT) as the Gaussian sampler and schoolbook approach for the polynomial multiplication. The purpose of this architecture is to achieve small area consumption with high frequency. The hardware implementation results on the Xilinx Kintex-7 FPGA show that the design consumes 808 slices and the frequency can be up to 288.35MHz.
DOI:10.1109/APCCAS.2018.8605630