Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks
Gespeichert in:
| Titel: | Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks |
|---|---|
| Autoren: | Esser, Andre, Santini, Paolo |
| Weitere Verfasser: | Leonid Reyzin, Douglas Stebila (editors), Esser, Andre, Santini, Paolo |
| Verlagsinformationen: | Springer |
| Publikationsjahr: | 2024 |
| Bestand: | Università Politecnica delle Marche: IRIS |
| Schlagwörter: | Hardness classification, Information Set Decoding, Code Based Cryptography |
| Beschreibung: | Cryptographic constructions often base security on structured problem variants to enhance efficiency or to enable advanced functionalities. This led to the introduction of the Regular Syndrome Decoding (RSD) problem, which guarantees that a solution to the Syndrome Decoding (SD) problem follows a particular block-wise structure. Despite recent attacks exploiting that structure by Briaud and Øygarden (Eurocrypt ’23) and Carozza, Couteau and Joux (CCJ, Eurocrypt ’23), many questions about the impact of the regular structure on the problem hardness remain open. In this work we initiate a systematic study of the hardness of the RSD problem starting from its asymptotics. We classify different parameter regimes revealing large regimes for which RSD instances are solvable in polynomial time and on the other hand regimes that lead to particularly hard instances. Against previous perceptions, we show that a classification solely based on the uniqueness of the solution is not sufficient for isolating the worst case parameters. Further, we provide an in-depth comparison between SD and RSD in terms of reducibility and computational complexity, identifying regimes in which RSD instances are actually harder to solve. We provide the first asymptotic analyses of the algorithms presented by CCJ, establishing their worst case decoding complexities as and , respectively. We then introduce regular-ISD algorithms by showing how to tailor the whole machinery of advanced Information Set Decoding (ISD) techniques from attacking SD to the RSD setting. The fastest regular-ISD algorithm improves the worst case decoding complexity significantly to . Eventually, we show that also with respect to suggested parameters regular-ISD outperforms previous approaches in most cases, reducing security levels by up to 30 bits. |
| Publikationsart: | conference object |
| Sprache: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/isbn/9783031683909; info:eu-repo/semantics/altIdentifier/isbn/9783031683916; info:eu-repo/semantics/altIdentifier/wos/WOS:001308754400006; ispartofbook:Advances in Cryptology – CRYPTO 2024; 44th Annual International Cryptology Conference; volume:14925; firstpage:183; lastpage:217; numberofpages:35; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11566/335213 |
| DOI: | 10.1007/978-3-031-68391-6_6 |
| Verfügbarkeit: | https://hdl.handle.net/11566/335213 https://doi.org/10.1007/978-3-031-68391-6_6 |
| Rights: | info:eu-repo/semantics/closedAccess ; license:Tutti i diritti riservati ; license uri:iris.PRI01 |
| Dokumentencode: | edsbas.79DF440C |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | FullText | Text: Availability: 0 CustomLinks: – Url: https://hdl.handle.net/11566/335213# 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=Esser%20A 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.79DF440C RelevancyScore: 914 AccessLevel: 3 PubType: Conference PubTypeId: conference PreciseRelevancyScore: 913.605590820313 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Esser%2C+Andre%22">Esser, Andre</searchLink><br /><searchLink fieldCode="AR" term="%22Santini%2C+Paolo%22">Santini, Paolo</searchLink> – Name: Author Label: Contributors Group: Au Data: Leonid Reyzin, Douglas Stebila (editors)<br />Esser, Andre<br />Santini, Paolo – Name: Publisher Label: Publisher Information Group: PubInfo Data: Springer – Name: DatePubCY Label: Publication Year Group: Date Data: 2024 – Name: Subset Label: Collection Group: HoldingsInfo Data: Università Politecnica delle Marche: IRIS – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Hardness+classification%22">Hardness classification</searchLink><br /><searchLink fieldCode="DE" term="%22Information+Set+Decoding%22">Information Set Decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Code+Based+Cryptography%22">Code Based Cryptography</searchLink> – Name: Abstract Label: Description Group: Ab Data: Cryptographic constructions often base security on structured problem variants to enhance efficiency or to enable advanced functionalities. This led to the introduction of the Regular Syndrome Decoding (RSD) problem, which guarantees that a solution to the Syndrome Decoding (SD) problem follows a particular block-wise structure. Despite recent attacks exploiting that structure by Briaud and Øygarden (Eurocrypt ’23) and Carozza, Couteau and Joux (CCJ, Eurocrypt ’23), many questions about the impact of the regular structure on the problem hardness remain open. In this work we initiate a systematic study of the hardness of the RSD problem starting from its asymptotics. We classify different parameter regimes revealing large regimes for which RSD instances are solvable in polynomial time and on the other hand regimes that lead to particularly hard instances. Against previous perceptions, we show that a classification solely based on the uniqueness of the solution is not sufficient for isolating the worst case parameters. Further, we provide an in-depth comparison between SD and RSD in terms of reducibility and computational complexity, identifying regimes in which RSD instances are actually harder to solve. We provide the first asymptotic analyses of the algorithms presented by CCJ, establishing their worst case decoding complexities as and , respectively. We then introduce regular-ISD algorithms by showing how to tailor the whole machinery of advanced Information Set Decoding (ISD) techniques from attacking SD to the RSD setting. The fastest regular-ISD algorithm improves the worst case decoding complexity significantly to . Eventually, we show that also with respect to suggested parameters regular-ISD outperforms previous approaches in most cases, reducing security levels by up to 30 bits. – Name: TypeDocument Label: Document Type Group: TypDoc Data: conference object – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: info:eu-repo/semantics/altIdentifier/isbn/9783031683909; info:eu-repo/semantics/altIdentifier/isbn/9783031683916; info:eu-repo/semantics/altIdentifier/wos/WOS:001308754400006; ispartofbook:Advances in Cryptology – CRYPTO 2024; 44th Annual International Cryptology Conference; volume:14925; firstpage:183; lastpage:217; numberofpages:35; serie:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11566/335213 – Name: DOI Label: DOI Group: ID Data: 10.1007/978-3-031-68391-6_6 – Name: URL Label: Availability Group: URL Data: https://hdl.handle.net/11566/335213<br />https://doi.org/10.1007/978-3-031-68391-6_6 – Name: Copyright Label: Rights Group: Cpyrght Data: info:eu-repo/semantics/closedAccess ; license:Tutti i diritti riservati ; license uri:iris.PRI01 – Name: AN Label: Accession Number Group: ID Data: edsbas.79DF440C |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.79DF440C |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/978-3-031-68391-6_6 Languages: – Text: English Subjects: – SubjectFull: Hardness classification Type: general – SubjectFull: Information Set Decoding Type: general – SubjectFull: Code Based Cryptography Type: general Titles: – TitleFull: Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Esser, Andre – PersonEntity: Name: NameFull: Santini, Paolo – PersonEntity: Name: NameFull: Leonid Reyzin, Douglas Stebila (editors) – PersonEntity: Name: NameFull: Esser, Andre – PersonEntity: Name: NameFull: Santini, Paolo IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2024 Identifiers: – Type: issn-locals Value: edsbas |
| ResultId | 1 |