Zobrazit v EDS

Generalized syndrome decoding problem and its application to post-quantum cryptography ; Problème de décodage de syndrome généralisé et son application à la cryptographie post-quantique

Uloženo v:
Podrobná bibliografie
Název: Generalized syndrome decoding problem and its application to post-quantum cryptography ; Problème de décodage de syndrome généralisé et son application à la cryptographie post-quantique
Autoři: Etinski, Simona
Přispěvatelé: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université Paris Cité, Frédéric Magniez
Zdroj: https://theses.hal.science/tel-04411272 ; Cryptography and Security [cs.CR]. Université Paris Cité, 2023. English. ⟨NNT : 2023UNIP7004⟩.
Informace o vydavateli: CCSD
Rok vydání: 2023
Témata: Stern's signature scheme, Information set decoding, Lee metric, Syndrome decoding problem, Schéma de signature de Stern, Décodage par ensemble d'information, Métrique de Lee, Problème du décodage du syndrome, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
Popis: In this thesis, we focus on the syndrome decoding problem (SDP), its generalization, cryptanalysis, and its application to digital signature scheme designs. We introduce a new problem, which we refer to as the generalized syndrome decoding problem. In the cryptanalytic part of the thesis, we then focus on the classical and quantum cryptanalysis of the generalized syndrome decoding problem using the information set decoding framework. More precisely, we calculate the running time of three different (classical) information set decoding algorithms, which we refer to as Prange's, Stern's/Dumer's, and Wagner's algorithms. The three algorithms are adapted to solve specific versions of the generalized problem which are given over the Hamming weight, taken as a baseline, and the Lee weight, taken as an alternative to the most commonly used Hamming weight. We then compare the obtained running times with the running time of the hybrid classical-quantum algorithm, obtained by introducing the Grover search and the amplitude amplification in the appropriate step of Wagner's algorithm. In the protocol design part of the paper, we modify Stern's identification protocol, and the corresponding signature scheme, to the newly introduced generalized syndrome decoding problem. To keep the zero-knowledge property of the scheme, we eventually replace the syndrome decoding problem with the permuted kernel one (PKP), for which we show that the average-case SDP reduces to average-case PKP. We then suggest different methods for optimizing the efficiency of the scheme and then provide numerical results that compare the efficiency of the original construction and our newly introduced scheme. The outcome of this work is an analysis of the newly introduced variant of the syndrome decoding problem which provides an estimate of the asymptotic complexity of the problem, as well as of the concrete security of the scheme based on this problem. The results indicate that the proper choice of a weight function introduces a harder version of the ...
Druh dokumentu: doctoral or postdoctoral thesis
Jazyk: English
Relation: NNT: 2023UNIP7004
Dostupnost: https://theses.hal.science/tel-04411272
https://theses.hal.science/tel-04411272v1/document
https://theses.hal.science/tel-04411272v1/file/va_Etinski_Simona.pdf
Rights: info:eu-repo/semantics/OpenAccess
Přístupové číslo: edsbas.20BE5B14
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://theses.hal.science/tel-04411272#
    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=Etinski%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: edsbas
DbLabel: BASE
An: edsbas.20BE5B14
RelevancyScore: 861
AccessLevel: 3
PubType: Dissertation/ Thesis
PubTypeId: dissertation
PreciseRelevancyScore: 860.92919921875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Generalized syndrome decoding problem and its application to post-quantum cryptography ; Problème de décodage de syndrome généralisé et son application à la cryptographie post-quantique
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Etinski%2C+Simona%22">Etinski, Simona</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243))<br />Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)<br />Université Paris Cité<br />Frédéric Magniez
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>https://theses.hal.science/tel-04411272 ; Cryptography and Security [cs.CR]. Université Paris Cité, 2023. English. ⟨NNT : 2023UNIP7004⟩</i>.
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: CCSD
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2023
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Stern's+signature+scheme%22">Stern's signature scheme</searchLink><br /><searchLink fieldCode="DE" term="%22Information+set+decoding%22">Information set decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Lee+metric%22">Lee metric</searchLink><br /><searchLink fieldCode="DE" term="%22Syndrome+decoding+problem%22">Syndrome decoding problem</searchLink><br /><searchLink fieldCode="DE" term="%22Schéma+de+signature+de+Stern%22">Schéma de signature de Stern</searchLink><br /><searchLink fieldCode="DE" term="%22Décodage+par+ensemble+d'information%22">Décodage par ensemble d'information</searchLink><br /><searchLink fieldCode="DE" term="%22Métrique+de+Lee%22">Métrique de Lee</searchLink><br /><searchLink fieldCode="DE" term="%22Problème+du+décodage+du+syndrome%22">Problème du décodage du syndrome</searchLink><br /><searchLink fieldCode="DE" term="%22[INFO%2EINFO-CR]Computer+Science+[cs]%2FCryptography+and+Security+[cs%2ECR]%22">[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: In this thesis, we focus on the syndrome decoding problem (SDP), its generalization, cryptanalysis, and its application to digital signature scheme designs. We introduce a new problem, which we refer to as the generalized syndrome decoding problem. In the cryptanalytic part of the thesis, we then focus on the classical and quantum cryptanalysis of the generalized syndrome decoding problem using the information set decoding framework. More precisely, we calculate the running time of three different (classical) information set decoding algorithms, which we refer to as Prange's, Stern's/Dumer's, and Wagner's algorithms. The three algorithms are adapted to solve specific versions of the generalized problem which are given over the Hamming weight, taken as a baseline, and the Lee weight, taken as an alternative to the most commonly used Hamming weight. We then compare the obtained running times with the running time of the hybrid classical-quantum algorithm, obtained by introducing the Grover search and the amplitude amplification in the appropriate step of Wagner's algorithm. In the protocol design part of the paper, we modify Stern's identification protocol, and the corresponding signature scheme, to the newly introduced generalized syndrome decoding problem. To keep the zero-knowledge property of the scheme, we eventually replace the syndrome decoding problem with the permuted kernel one (PKP), for which we show that the average-case SDP reduces to average-case PKP. We then suggest different methods for optimizing the efficiency of the scheme and then provide numerical results that compare the efficiency of the original construction and our newly introduced scheme. The outcome of this work is an analysis of the newly introduced variant of the syndrome decoding problem which provides an estimate of the asymptotic complexity of the problem, as well as of the concrete security of the scheme based on this problem. The results indicate that the proper choice of a weight function introduces a harder version of the ...
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: doctoral or postdoctoral thesis
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: NNT: 2023UNIP7004
– Name: URL
  Label: Availability
  Group: URL
  Data: https://theses.hal.science/tel-04411272<br />https://theses.hal.science/tel-04411272v1/document<br />https://theses.hal.science/tel-04411272v1/file/va_Etinski_Simona.pdf
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/OpenAccess
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.20BE5B14
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.20BE5B14
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Stern's signature scheme
        Type: general
      – SubjectFull: Information set decoding
        Type: general
      – SubjectFull: Lee metric
        Type: general
      – SubjectFull: Syndrome decoding problem
        Type: general
      – SubjectFull: Schéma de signature de Stern
        Type: general
      – SubjectFull: Décodage par ensemble d'information
        Type: general
      – SubjectFull: Métrique de Lee
        Type: general
      – SubjectFull: Problème du décodage du syndrome
        Type: general
      – SubjectFull: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
        Type: general
    Titles:
      – TitleFull: Generalized syndrome decoding problem and its application to post-quantum cryptography ; Problème de décodage de syndrome généralisé et son application à la cryptographie post-quantique
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Etinski, Simona
      – PersonEntity:
          Name:
            NameFull: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243))
      – PersonEntity:
          Name:
            NameFull: Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)
      – PersonEntity:
          Name:
            NameFull: Université Paris Cité
      – PersonEntity:
          Name:
            NameFull: Frédéric Magniez
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: https://theses.hal.science/tel-04411272 ; Cryptography and Security [cs.CR]. Université Paris Cité, 2023. English. ⟨NNT : 2023UNIP7004⟩
              Type: main
ResultId 1