Zobrazit v EDS

Complexity of statistical attacks on QC-LDPC code-based cryptosystems

Uloženo v:
Podrobná bibliografie
Název: Complexity of statistical attacks on QC-LDPC code-based cryptosystems
Autoři: SANTINI, PAOLO, Baldi, Marco, Chiaraluce, Franco
Přispěvatelé: Santini, Paolo, Baldi, Marco, Chiaraluce, Franco
Rok vydání: 2020
Sbírka: Università Politecnica delle Marche: IRIS
Témata: Code-based cryptosystems, cryptanalyis, post-quantum cryptography, QC-LDPC codes, statistical attacks
Popis: Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density parity-check codes are promising candidates for post-quantum cryptography, since they are characterised by compact keys and high algorithmic efficiency. The main issue with this kind of system is represented by the fact that, since the decoding procedure is probabilistic, it may leak information about the secret key. In this work, the authors study cryptanalysis procedures that aim at recovering the secret key by exploiting this fact. They identify the phenomenon that is at the basis of these procedures and show that the QC structure plays an important role in the success of these attacks. They use a graph analogy to study the complexity of these attacks, and show that their feasibility strongly depends on the QC structure. They also devise an approach to perform full cryptanalysis by combining an information set decoding algorithm with some partial knowledge about the structure of the secret key.
Druh dokumentu: article in journal/newspaper
Popis souboru: ELETTRONICO
Jazyk: English
Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000561335400005; volume:14; issue:3; firstpage:304; lastpage:312; numberofpages:9; journal:IET INFORMATION SECURITY; https://hdl.handle.net/11566/271987
DOI: 10.1049/iet-ifs.2019.0420
Dostupnost: https://hdl.handle.net/11566/271987
https://doi.org/10.1049/iet-ifs.2019.0420
Rights: info:eu-repo/semantics/openAccess ; license:Tutti i diritti riservati ; license:Licenza specifica dell'editore ; license uri:iris.PRI01 ; license uri:iris.PRI02
Přístupové číslo: edsbas.129B368F
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/11566/271987#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=SANTINI%20PAOLO
    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: edsbas
DbLabel: BASE
An: edsbas.129B368F
RelevancyScore: 894
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 893.994323730469
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Complexity of statistical attacks on QC-LDPC code-based cryptosystems
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22SANTINI%2C+PAOLO%22">SANTINI, PAOLO</searchLink><br /><searchLink fieldCode="AR" term="%22Baldi%2C+Marco%22">Baldi, Marco</searchLink><br /><searchLink fieldCode="AR" term="%22Chiaraluce%2C+Franco%22">Chiaraluce, Franco</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Santini, Paolo<br />Baldi, Marco<br />Chiaraluce, Franco
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2020
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Università Politecnica delle Marche: IRIS
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Code-based+cryptosystems%22">Code-based cryptosystems</searchLink><br /><searchLink fieldCode="DE" term="%22cryptanalyis%22">cryptanalyis</searchLink><br /><searchLink fieldCode="DE" term="%22post-quantum+cryptography%22">post-quantum cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22QC-LDPC+codes%22">QC-LDPC codes</searchLink><br /><searchLink fieldCode="DE" term="%22statistical+attacks%22">statistical attacks</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density parity-check codes are promising candidates for post-quantum cryptography, since they are characterised by compact keys and high algorithmic efficiency. The main issue with this kind of system is represented by the fact that, since the decoding procedure is probabilistic, it may leak information about the secret key. In this work, the authors study cryptanalysis procedures that aim at recovering the secret key by exploiting this fact. They identify the phenomenon that is at the basis of these procedures and show that the QC structure plays an important role in the success of these attacks. They use a graph analogy to study the complexity of these attacks, and show that their feasibility strongly depends on the QC structure. They also devise an approach to perform full cryptanalysis by combining an information set decoding algorithm with some partial knowledge about the structure of the secret key.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: ELETTRONICO
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: info:eu-repo/semantics/altIdentifier/wos/WOS:000561335400005; volume:14; issue:3; firstpage:304; lastpage:312; numberofpages:9; journal:IET INFORMATION SECURITY; https://hdl.handle.net/11566/271987
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1049/iet-ifs.2019.0420
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/11566/271987<br />https://doi.org/10.1049/iet-ifs.2019.0420
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/openAccess ; license:Tutti i diritti riservati ; license:Licenza specifica dell'editore ; license uri:iris.PRI01 ; license uri:iris.PRI02
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.129B368F
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.129B368F
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1049/iet-ifs.2019.0420
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Code-based cryptosystems
        Type: general
      – SubjectFull: cryptanalyis
        Type: general
      – SubjectFull: post-quantum cryptography
        Type: general
      – SubjectFull: QC-LDPC codes
        Type: general
      – SubjectFull: statistical attacks
        Type: general
    Titles:
      – TitleFull: Complexity of statistical attacks on QC-LDPC code-based cryptosystems
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: SANTINI, PAOLO
      – PersonEntity:
          Name:
            NameFull: Baldi, Marco
      – PersonEntity:
          Name:
            NameFull: Chiaraluce, Franco
      – PersonEntity:
          Name:
            NameFull: Santini, Paolo
      – PersonEntity:
          Name:
            NameFull: Baldi, Marco
      – PersonEntity:
          Name:
            NameFull: Chiaraluce, Franco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1