x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes
Abstract Lattice‐based cryptography is one of the most promising cryptographic scheme which lies on the hardness of ring‐learning‐with‐error (RLWE). A new variant of RLWE, known as binary‐ring‐learning‐with‐error (BRLWE), has less key size and more efficient hardware implementations compared to RLWE...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-12-01
|
| Series: | IET Quantum Communication |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/qtc2.12110 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846100825296863232 |
|---|---|
| author | Shaik Ahmadunnisa Sudha Ellison Mathe |
| author_facet | Shaik Ahmadunnisa Sudha Ellison Mathe |
| author_sort | Shaik Ahmadunnisa |
| collection | DOAJ |
| description | Abstract Lattice‐based cryptography is one of the most promising cryptographic scheme which lies on the hardness of ring‐learning‐with‐error (RLWE). A new variant of RLWE, known as binary‐ring‐learning‐with‐error (BRLWE), has less key size and more efficient hardware implementations compared to RLWE‐based schemes. The key arithmetic operation for BRLWE‐based encryption scheme is the implementation of arithmetic operation represented by FD+H, where both F and H are integer polynomials, and D is a binary polynomial. An efficient architecture to perform the arithmetic operation FD+H over a polynomial ring xn+1 is proposed. We employ two linear feedback shift register structures comprising x2‐net units in our design to reduce the computational time. This reduction in computational time yields to a significant improvement in the other performance metrics such as delay, area‐delay product (ADP), power‐delay product, throughput and efficiency compared to the existing designs. As per the experimental results, the authors’ proposed design has 32% improvement in ADP when compared to the recently reported work. |
| format | Article |
| id | doaj-art-4bfdc2e00ff14d2092ff9f521e8f8800 |
| institution | Kabale University |
| issn | 2632-8925 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Quantum Communication |
| spelling | doaj-art-4bfdc2e00ff14d2092ff9f521e8f88002024-12-29T13:34:29ZengWileyIET Quantum Communication2632-89252024-12-015434935910.1049/qtc2.12110x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemesShaik Ahmadunnisa0Sudha Ellison Mathe1School of Electronics Engineering VIT‐AP University Vijayawada IndiaSchool of Electronics Engineering VIT‐AP University Vijayawada IndiaAbstract Lattice‐based cryptography is one of the most promising cryptographic scheme which lies on the hardness of ring‐learning‐with‐error (RLWE). A new variant of RLWE, known as binary‐ring‐learning‐with‐error (BRLWE), has less key size and more efficient hardware implementations compared to RLWE‐based schemes. The key arithmetic operation for BRLWE‐based encryption scheme is the implementation of arithmetic operation represented by FD+H, where both F and H are integer polynomials, and D is a binary polynomial. An efficient architecture to perform the arithmetic operation FD+H over a polynomial ring xn+1 is proposed. We employ two linear feedback shift register structures comprising x2‐net units in our design to reduce the computational time. This reduction in computational time yields to a significant improvement in the other performance metrics such as delay, area‐delay product (ADP), power‐delay product, throughput and efficiency compared to the existing designs. As per the experimental results, the authors’ proposed design has 32% improvement in ADP when compared to the recently reported work.https://doi.org/10.1049/qtc2.12110binary ring learning with errorcryptographylattice based cryptographypolynomial multiplicationpost quantum cryptography |
| spellingShingle | Shaik Ahmadunnisa Sudha Ellison Mathe x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes IET Quantum Communication binary ring learning with error cryptography lattice based cryptography polynomial multiplication post quantum cryptography |
| title | x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes |
| title_full | x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes |
| title_fullStr | x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes |
| title_full_unstemmed | x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes |
| title_short | x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes |
| title_sort | x2dl a high throughput architecture for binary ring learning with error based post quantum cryptography schemes |
| topic | binary ring learning with error cryptography lattice based cryptography polynomial multiplication post quantum cryptography |
| url | https://doi.org/10.1049/qtc2.12110 |
| work_keys_str_mv | AT shaikahmadunnisa x2dlahighthroughputarchitectureforbinaryringlearningwitherrorbasedpostquantumcryptographyschemes AT sudhaellisonmathe x2dlahighthroughputarchitectureforbinaryringlearningwitherrorbasedpostquantumcryptographyschemes |