CNC: A lightweight architecture for Binary Ring-LWE based PQC.
Uloženo v:
| Název: | CNC: A lightweight architecture for Binary Ring-LWE based PQC. |
|---|---|
| Autoři: | Ahmadunnisa, Shaik1 (AUTHOR) ahmadunnisashaik@gmail.com, Mathe, Sudha Ellison1 (AUTHOR) ellison.ece@gmail.com |
| Zdroj: | Microprocessors & Microsystems. Apr2024, Vol. 106, pN.PAG-N.PAG. 1p. |
| Témata: | *POLYNOMIAL rings, *ELLIPTIC curve cryptography, *ARITHMETIC, *COMPUTATIONAL complexity, *QUANTUM cryptography |
| Abstrakt: | In lattice-based cryptography, Ring Learning with Errors (RLWE) is a computationally hard cryptographic problem, comprising three basic mechanisms i.e., key generation, encryption, and decryption. Binary Ring Learning with Error (BRLWE), a new variant of RLWE has been proposed recently to reduce the key size and computational complexity compared to previous RLWE-based schemes. Based on this BRLWE scheme, efficient hardware architectures have been obtained in recent works for lightweight applications. The key operation involved in this scheme is A B + C , where A and C are integer polynomials and B is a binary polynomial. This paper proposes an efficient hardware architecture for BRLWE-based scheme targeted for lightweight applications. The architecture computes the arithmetic operation A B + C , which includes polynomial multiplication and addition over the polynomial ring Z q / (x n + 1). The proposed architecture is applied in two conditions, fixed and variable values of q. Experimental results show the architecture proposed has 50% less Area-Delay Product (ADP) and 20% less Power-Delay Product (PDP) compared to the recently reported work for n = 256. [ABSTRACT FROM AUTHOR] |
| Databáze: | Academic Search Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!