¡Nos trasladamos! E-Prints cerrará el 7 de junio.

En las próximas semanas vamos a migrar nuestro repositorio a una nueva plataforma con muchas funcionalidades nuevas. En esta migración las fechas clave del proceso son las siguientes:

Es muy importante que cualquier depósito se realice en E-Prints Complutense antes del 7 de junio. En caso de urgencia para realizar un depósito, se puede comunicar a docta@ucm.es.

Efficient hardware arithmetic for inverted binary ring-LWE based post-quantum cryptography



Downloads per month over past year

Imaña Pascual, José Luis and He, Pengzhou and Bao, Tianyou and Tu, Yazheng (2022) Efficient hardware arithmetic for inverted binary ring-LWE based post-quantum cryptography. IEEE transactions on circuits and systems I-regular papers . ISSN 1549-8328

[thumbnail of Imaña25postprint.pdf]

Official URL: http://dx.doi.org/10.1109/TCSI.2022.3169471


Ring learning-with-errors (RLWE)-based encryption scheme is a lattice-based cryptographic algorithm that constitutes one of the most promising candidates for Post-Quantum Cryptography (PQC) standardization due to its efficient implementation and low computational complexity. Binary Ring-LWE (BRLWE) is a new optimized variant of RLWE, which achieves smaller computational complexity and higher efficient hardware implementations. In this paper, two efficient architectures based on Linear-Feedback Shift Register (LFSR) for the arithmetic used in Inverted Binary Ring-LWE (InvBRLWE)-based encryption scheme are presented, namely the operation of A center dot B+C over the polynomial ring ${Z}_q/(x<^>n+1)$ . The first architecture optimizes the resource usage for major computation and has a novel input processing setup to speed up the overall processing latency with minimized input loading cycles. The second architecture deploys an innovative serial-in serial-out processing format to reduce the involved area usage further yet maintains a regular input loading time-complexity. Experimental results show that the architectures presented here improve the complexities obtained by competing schemes found in the literature, e.g., involving 71.23% less area-delay product than recent designs. Both architectures are highly efficient in terms of area-time complexities and can be extended for deploying in different lightweight application environments.

Item Type:Article
Additional Information:

©2022 IEEE
The work of José L. Imaña was supported in part by the Spanish Government Ministerio de Economia y Competitividad (MINECO) under Grant RTI2018-093684-B-I00 and in part by the Comunidad de Madrid under Grant S2018/TCS-4423. The work of Jiafeng Xie was supported by the National Science Foundation (NSF) Award under Grant SaTC-2020625 and Grant NIST-60NANB20D203.

Uncontrolled Keywords:Polynomial multiplication; Implementation; Architecture; Lightweight; Computer architecture; Hardware; Arithmetic; Cryptography; Encryption; Loading; Elliptic curve cryptography; Binary ring-LWE; Hardware design; Lattice-based; LFSR; Post-quantum cryptography; Polynomial arithmetic
Subjects:Sciences > Computer science > Artificial intelligence
ID Code:72462
Deposited On:06 Jun 2022 17:17
Last Modified:13 Jun 2022 08:23

Origin of downloads

Repository Staff Only: item control page