.png){kind=icon}
Return
A Lightweight and Efficient Encryption/Decryption Coprocessor for RLWE-Based Cryptography
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2024.3451971.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Lattice-based cryptography has experienced significant advancements in recent years due to its versatility and simplicity. The ring learning with errors (RLWE) problem is widely adopted in lattice-based cryptography. However, the polynomial multiplication is the performance bottleneck of RLWE-based cryptography, which requires further examination. In this brief, a lightweight and efficient encryption/decryption coprocessor for RLWE-based cryptography is proposed. The time complexity of the Schoolbook polynomial multiplication (SPM) is reduced from n(2) to n(2)/8 by enhancing multiplication parallelism. Moreover, an optimized structure for the Compressed cumulative distribution table (CDT) Gaussian sampler is proposed, resulting in 22.2% reduction in storage resource. The proposed SPM structure demonstrates a 2.3x performance speedup and 2.7x hardware efficiency for the encryption core, compared with state-of-the-art SPM accelerators. Additionally, it achieves a 2.4x performance speedup and 3.2x improvements on hardware efficiency for the decryption core.
Keywords:
Schoolbook polynomial multiplication (SPM)
ring learning with errors (RLWE)
saber
FPGA
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveCompact Modeling of a Generic Double-Gate MOSFET With Gate–S/D Underlap for Subthreshold Operation
PREAI
ShareSave
View more