Zobrazit v EDS

x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes.

Uloženo v:
Podrobná bibliografie
Název: x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes.
Autoři: Ahmadunnisa, Shaik, Mathe, Sudha Ellison
Zdroj: IET Quantum Communication; Dec2024, Vol. 5 Issue 4, p349-359, 11p
Témata: LATTICE theory, CRYPTOGRAPHY, COMPUTER input-output equipment, POLYNOMIALS
Abstrakt: 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 $FD+H$, where both F $F$ and H $H$ are integer polynomials, and D $D$ is a binary polynomial. An efficient architecture to perform the arithmetic operation FD+H $FD+H$ over a polynomial ring xn+1 ${x}^{n}+1$ is proposed. We employ two linear feedback shift register structures comprising x2 ${x}^{2}$‐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% $32\%$ improvement in ADP when compared to the recently reported work. [ABSTRACT FROM AUTHOR]
Copyright of IET Quantum Communication is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=26328925&ISBN=&volume=5&issue=4&date=20241201&spage=349&pages=349-359&title=IET Quantum Communication&atitle=x2DL%3A%20A%20high%20throughput%20architecture%20for%20binary%E2%80%90ring%E2%80%90learning%E2%80%90with%E2%80%90error%E2%80%90based%20post%20quantum%20cryptography%20schemes.&aulast=Ahmadunnisa%2C%20Shaik&id=DOI:10.1049/qtc2.12110
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Ahmadunnisa%20S
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 187007613
RelevancyScore: 1007
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1007.06323242188
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: x<superscript>2</superscript>DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ahmadunnisa%2C+Shaik%22">Ahmadunnisa, Shaik</searchLink><br /><searchLink fieldCode="AR" term="%22Mathe%2C+Sudha+Ellison%22">Mathe, Sudha Ellison</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: IET Quantum Communication; Dec2024, Vol. 5 Issue 4, p349-359, 11p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22LATTICE+theory%22">LATTICE theory</searchLink><br /><searchLink fieldCode="DE" term="%22CRYPTOGRAPHY%22">CRYPTOGRAPHY</searchLink><br /><searchLink fieldCode="DE" term="%22COMPUTER+input-output+equipment%22">COMPUTER input-output equipment</searchLink><br /><searchLink fieldCode="DE" term="%22POLYNOMIALS%22">POLYNOMIALS</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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 $FD+H$, where both F $F$ and H $H$ are integer polynomials, and D $D$ is a binary polynomial. An efficient architecture to perform the arithmetic operation FD+H $FD+H$ over a polynomial ring xn+1 ${x}^{n}+1$ is proposed. We employ two linear feedback shift register structures comprising x2 ${x}^{2}$‐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% $32\%$ improvement in ADP when compared to the recently reported work. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of IET Quantum Communication is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=187007613
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1049/qtc2.12110
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 349
    Subjects:
      – SubjectFull: LATTICE theory
        Type: general
      – SubjectFull: CRYPTOGRAPHY
        Type: general
      – SubjectFull: COMPUTER input-output equipment
        Type: general
      – SubjectFull: POLYNOMIALS
        Type: general
    Titles:
      – TitleFull: x2DL: A high throughput architecture for binary‐ring‐learning‐with‐error‐based post quantum cryptography schemes.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ahmadunnisa, Shaik
      – PersonEntity:
          Name:
            NameFull: Mathe, Sudha Ellison
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 26328925
          Numbering:
            – Type: volume
              Value: 5
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: IET Quantum Communication
              Type: main
ResultId 1