Code-Based Cryptography: 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
2023
|
| Ausgabe: | 1st ed |
| Schriftenreihe: | Lecture Notes in Computer Science Series
v.13839 |
| Schlagworte: | |
| Online-Zugang: | DE-2070s |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 Online-Ressource (163 Seiten) |
| ISBN: | 9783031296895 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV049872944 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 240919s2023 xx o|||| 00||| eng d | ||
| 020 | |a 9783031296895 |9 978-3-031-29689-5 | ||
| 035 | |a (ZDB-30-PQE)EBC7221120 | ||
| 035 | |a (ZDB-30-PAD)EBC7221120 | ||
| 035 | |a (ZDB-89-EBL)EBL7221120 | ||
| 035 | |a (OCoLC)1379626454 | ||
| 035 | |a (DE-599)BVBBV049872944 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-2070s | ||
| 082 | 0 | |a 652.8 | |
| 100 | 1 | |a Deneuville, Jean-Christophe |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Code-Based Cryptography |b 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Cham |b Springer |c 2023 | |
| 264 | 4 | |c ©2023 | |
| 300 | |a 1 Online-Ressource (163 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Computer Science Series |v v.13839 | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 505 | 8 | |a Intro -- Preface -- Organization -- Contents -- Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 The Sum-Rank Metric -- 2.2 Automorphisms, Derivations, and Conjugacy -- 2.3 Isometries in the Sum-Rank Metric -- 2.4 Skew Polynomials -- 2.5 (Generalized) Linearized Reed-Solomon Codes -- 3 Problem Statement -- 4 Distinguishers for GLRS Codes -- 4.1 A Square-Code Distinguisher -- 4.2 An Overbeck-Like Distinguisher -- 5 Recovery of a Canonical Generator Matrix -- 5.1 Square-Code Approach -- 5.2 Overbeck-Like Approach -- 6 Conclusion -- References -- Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions Towards Classic McEliece Implementation Verification -- 2 Our Toolchain and Its Target -- 3 Verifying Classic McEliece with SAW/Cryptol -- 3.1 Verification Details -- 4 Verifying Aspects of Classic McEliece with Lean -- 5 Conclusions and Perspectives -- 5.1 Recommendations -- 5.2 Future Work Using Similar Approaches -- References -- Key-Recovery Fault Injection Attack on the Classic McEliece KEM -- 1 Introduction -- 2 Classic McEliece KEM -- 2.1 Key Generation -- 2.2 Encapsulation -- 2.3 Decapsulation -- 2.4 Implementation -- 3 Key-Recovery Attack -- 3.1 Fault Model -- 3.2 Fault Attack on the Validity Checks (VCB) -- 3.3 Fault Attack on the ELP Coefficients -- 3.4 Computing Alternative Secret Keys -- 4 Fault Attack Implementation and Simulation -- 4.1 Key-Recovery Simulation -- 4.2 De-hashing: Obtaining the Faulty Error Vector from Hash Output -- 4.3 Simulation at Register Transfer Level -- 5 Summary -- A Appendix -- A.1 Classic McEliece KEM Algorithms and Parameters -- References -- Towards Automating Cryptographic Hardware Implementations: A Case Study of HQC. | |
| 505 | 8 | |a 1 Introduction -- 1.1 Design Artifacts -- 1.2 Outline of the Paper -- 2 Preliminaries and Background -- 2.1 Notations -- 2.2 Background on HQC -- 3 HLS Design Implementation of the HQC -- 3.1 HLS Implementation: Basics -- 3.2 Methodology and Implementation -- 4 Results and Comparisons -- 4.1 Target Settings -- 4.2 Synthesis Results -- 4.3 Modular Comparisons Among Different Versions -- 4.4 Comparisons with Software Implementations -- 4.5 Comparison with State-of-art Hardware Implementations -- 5 Conclusions -- References -- Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes -- 1 Introduction -- 2 Prerequisites -- 2.1 Notations -- 2.2 Coding Theory -- 2.3 Key Encapsulation Mechanism -- 3 KEM from Binary QD-GS Codes -- 3.1 Description -- 3.2 Security Analysis -- 4 Efficient Implementation -- 4.1 Implementation Details -- 4.2 Results -- 5 Conclusion -- References -- On Decoding High-Order Interleaved Sum-Rank-Metric Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Sum-Rank-Metric Codes -- 2.2 Interleaved Sum-Rank-Metric Codes and Channel Model -- 3 Decoding of High-Order Interleaved Sum-Rank-Metric Codes -- 3.1 The Error Support -- 3.2 Recovering the Error Support -- 3.3 A Metzner-Kapturowski-Like Decoding Algorithm -- 4 Implications for Decoding High-Order Interleaved Skew-Metric Codes -- 5 Comparison of Metzner-Kapturowski-Like Decoders in the Hamming, Rank and Sum-Rank Metric -- 6 Conclusion -- References -- Information Set Decoding for Lee-Metric Codes Using Restricted Balls -- 1 Introduction -- 2 Preliminaries -- 3 Distribution of a Random Lee Vector -- 4 Restricted-Balls Algorithm -- 4.1 Decoding up to the Minimum Lee Distance -- 4.2 Decoding Beyond the Minimum Distance -- 5 Comparison -- Appendix A Asymptotics -- Appendix A.1 Asymptotics of Lee Spheres | |
| 505 | 8 | |a Appendix B Proofs of Lemma 4 and 7 -- References -- Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 m-block Codes -- 2.2 Subfield Images of Codes -- 2.3 Generalized Reed-Solomon Codes -- 3 Ivanov-Krouk-Zyablov Cryptosystem -- 3.1 Protocol Description -- 3.2 Message-Recovery Attack -- 4 Direct Key-Recovery Attack -- 4.1 Case of Even k -- 4.2 Case of Odd k -- 5 Twisted Squares-Based Attack -- 5.1 Recovering the Support x -- 5.2 Recovering the Matrix Q -- 6 Conclusion -- References -- Author Index | |
| 650 | 4 | |a Coding theory-Congresses | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2022 |z Trondheim ; Online |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Deneuville, Jean-Christophe |t Code-Based Cryptography |d Cham : Springer,c2023 |z 9783031296888 |
| 912 | |a ZDB-30-PQE | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035212402 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/hwr/detail.action?docID=7221120 |l DE-2070s |p ZDB-30-PQE |q HWR_PDA_PQE |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820889810131222528 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Deneuville, Jean-Christophe |
| author_facet | Deneuville, Jean-Christophe |
| author_role | aut |
| author_sort | Deneuville, Jean-Christophe |
| author_variant | j c d jcd |
| building | Verbundindex |
| bvnumber | BV049872944 |
| classification_rvk | SS 4800 |
| collection | ZDB-30-PQE |
| contents | Intro -- Preface -- Organization -- Contents -- Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 The Sum-Rank Metric -- 2.2 Automorphisms, Derivations, and Conjugacy -- 2.3 Isometries in the Sum-Rank Metric -- 2.4 Skew Polynomials -- 2.5 (Generalized) Linearized Reed-Solomon Codes -- 3 Problem Statement -- 4 Distinguishers for GLRS Codes -- 4.1 A Square-Code Distinguisher -- 4.2 An Overbeck-Like Distinguisher -- 5 Recovery of a Canonical Generator Matrix -- 5.1 Square-Code Approach -- 5.2 Overbeck-Like Approach -- 6 Conclusion -- References -- Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions Towards Classic McEliece Implementation Verification -- 2 Our Toolchain and Its Target -- 3 Verifying Classic McEliece with SAW/Cryptol -- 3.1 Verification Details -- 4 Verifying Aspects of Classic McEliece with Lean -- 5 Conclusions and Perspectives -- 5.1 Recommendations -- 5.2 Future Work Using Similar Approaches -- References -- Key-Recovery Fault Injection Attack on the Classic McEliece KEM -- 1 Introduction -- 2 Classic McEliece KEM -- 2.1 Key Generation -- 2.2 Encapsulation -- 2.3 Decapsulation -- 2.4 Implementation -- 3 Key-Recovery Attack -- 3.1 Fault Model -- 3.2 Fault Attack on the Validity Checks (VCB) -- 3.3 Fault Attack on the ELP Coefficients -- 3.4 Computing Alternative Secret Keys -- 4 Fault Attack Implementation and Simulation -- 4.1 Key-Recovery Simulation -- 4.2 De-hashing: Obtaining the Faulty Error Vector from Hash Output -- 4.3 Simulation at Register Transfer Level -- 5 Summary -- A Appendix -- A.1 Classic McEliece KEM Algorithms and Parameters -- References -- Towards Automating Cryptographic Hardware Implementations: A Case Study of HQC. 1 Introduction -- 1.1 Design Artifacts -- 1.2 Outline of the Paper -- 2 Preliminaries and Background -- 2.1 Notations -- 2.2 Background on HQC -- 3 HLS Design Implementation of the HQC -- 3.1 HLS Implementation: Basics -- 3.2 Methodology and Implementation -- 4 Results and Comparisons -- 4.1 Target Settings -- 4.2 Synthesis Results -- 4.3 Modular Comparisons Among Different Versions -- 4.4 Comparisons with Software Implementations -- 4.5 Comparison with State-of-art Hardware Implementations -- 5 Conclusions -- References -- Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes -- 1 Introduction -- 2 Prerequisites -- 2.1 Notations -- 2.2 Coding Theory -- 2.3 Key Encapsulation Mechanism -- 3 KEM from Binary QD-GS Codes -- 3.1 Description -- 3.2 Security Analysis -- 4 Efficient Implementation -- 4.1 Implementation Details -- 4.2 Results -- 5 Conclusion -- References -- On Decoding High-Order Interleaved Sum-Rank-Metric Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Sum-Rank-Metric Codes -- 2.2 Interleaved Sum-Rank-Metric Codes and Channel Model -- 3 Decoding of High-Order Interleaved Sum-Rank-Metric Codes -- 3.1 The Error Support -- 3.2 Recovering the Error Support -- 3.3 A Metzner-Kapturowski-Like Decoding Algorithm -- 4 Implications for Decoding High-Order Interleaved Skew-Metric Codes -- 5 Comparison of Metzner-Kapturowski-Like Decoders in the Hamming, Rank and Sum-Rank Metric -- 6 Conclusion -- References -- Information Set Decoding for Lee-Metric Codes Using Restricted Balls -- 1 Introduction -- 2 Preliminaries -- 3 Distribution of a Random Lee Vector -- 4 Restricted-Balls Algorithm -- 4.1 Decoding up to the Minimum Lee Distance -- 4.2 Decoding Beyond the Minimum Distance -- 5 Comparison -- Appendix A Asymptotics -- Appendix A.1 Asymptotics of Lee Spheres Appendix B Proofs of Lemma 4 and 7 -- References -- Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 m-block Codes -- 2.2 Subfield Images of Codes -- 2.3 Generalized Reed-Solomon Codes -- 3 Ivanov-Krouk-Zyablov Cryptosystem -- 3.1 Protocol Description -- 3.2 Message-Recovery Attack -- 4 Direct Key-Recovery Attack -- 4.1 Case of Even k -- 4.2 Case of Odd k -- 5 Twisted Squares-Based Attack -- 5.1 Recovering the Support x -- 5.2 Recovering the Matrix Q -- 6 Conclusion -- References -- Author Index |
| ctrlnum | (ZDB-30-PQE)EBC7221120 (ZDB-30-PAD)EBC7221120 (ZDB-89-EBL)EBL7221120 (OCoLC)1379626454 (DE-599)BVBBV049872944 |
| dewey-full | 652.8 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 652 - Processes of written communication |
| dewey-raw | 652.8 |
| dewey-search | 652.8 |
| dewey-sort | 3652.8 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Wirtschaftswissenschaften |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV049872944</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">240919s2023 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031296895</subfield><subfield code="9">978-3-031-29689-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC7221120</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC7221120</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL7221120</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1379626454</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049872944</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-2070s</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">652.8</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Deneuville, Jean-Christophe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Code-Based Cryptography</subfield><subfield code="b">10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">2023</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (163 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lecture Notes in Computer Science Series</subfield><subfield code="v">v.13839</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Intro -- Preface -- Organization -- Contents -- Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 The Sum-Rank Metric -- 2.2 Automorphisms, Derivations, and Conjugacy -- 2.3 Isometries in the Sum-Rank Metric -- 2.4 Skew Polynomials -- 2.5 (Generalized) Linearized Reed-Solomon Codes -- 3 Problem Statement -- 4 Distinguishers for GLRS Codes -- 4.1 A Square-Code Distinguisher -- 4.2 An Overbeck-Like Distinguisher -- 5 Recovery of a Canonical Generator Matrix -- 5.1 Square-Code Approach -- 5.2 Overbeck-Like Approach -- 6 Conclusion -- References -- Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions Towards Classic McEliece Implementation Verification -- 2 Our Toolchain and Its Target -- 3 Verifying Classic McEliece with SAW/Cryptol -- 3.1 Verification Details -- 4 Verifying Aspects of Classic McEliece with Lean -- 5 Conclusions and Perspectives -- 5.1 Recommendations -- 5.2 Future Work Using Similar Approaches -- References -- Key-Recovery Fault Injection Attack on the Classic McEliece KEM -- 1 Introduction -- 2 Classic McEliece KEM -- 2.1 Key Generation -- 2.2 Encapsulation -- 2.3 Decapsulation -- 2.4 Implementation -- 3 Key-Recovery Attack -- 3.1 Fault Model -- 3.2 Fault Attack on the Validity Checks (VCB) -- 3.3 Fault Attack on the ELP Coefficients -- 3.4 Computing Alternative Secret Keys -- 4 Fault Attack Implementation and Simulation -- 4.1 Key-Recovery Simulation -- 4.2 De-hashing: Obtaining the Faulty Error Vector from Hash Output -- 4.3 Simulation at Register Transfer Level -- 5 Summary -- A Appendix -- A.1 Classic McEliece KEM Algorithms and Parameters -- References -- Towards Automating Cryptographic Hardware Implementations: A Case Study of HQC.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1 Introduction -- 1.1 Design Artifacts -- 1.2 Outline of the Paper -- 2 Preliminaries and Background -- 2.1 Notations -- 2.2 Background on HQC -- 3 HLS Design Implementation of the HQC -- 3.1 HLS Implementation: Basics -- 3.2 Methodology and Implementation -- 4 Results and Comparisons -- 4.1 Target Settings -- 4.2 Synthesis Results -- 4.3 Modular Comparisons Among Different Versions -- 4.4 Comparisons with Software Implementations -- 4.5 Comparison with State-of-art Hardware Implementations -- 5 Conclusions -- References -- Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes -- 1 Introduction -- 2 Prerequisites -- 2.1 Notations -- 2.2 Coding Theory -- 2.3 Key Encapsulation Mechanism -- 3 KEM from Binary QD-GS Codes -- 3.1 Description -- 3.2 Security Analysis -- 4 Efficient Implementation -- 4.1 Implementation Details -- 4.2 Results -- 5 Conclusion -- References -- On Decoding High-Order Interleaved Sum-Rank-Metric Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Sum-Rank-Metric Codes -- 2.2 Interleaved Sum-Rank-Metric Codes and Channel Model -- 3 Decoding of High-Order Interleaved Sum-Rank-Metric Codes -- 3.1 The Error Support -- 3.2 Recovering the Error Support -- 3.3 A Metzner-Kapturowski-Like Decoding Algorithm -- 4 Implications for Decoding High-Order Interleaved Skew-Metric Codes -- 5 Comparison of Metzner-Kapturowski-Like Decoders in the Hamming, Rank and Sum-Rank Metric -- 6 Conclusion -- References -- Information Set Decoding for Lee-Metric Codes Using Restricted Balls -- 1 Introduction -- 2 Preliminaries -- 3 Distribution of a Random Lee Vector -- 4 Restricted-Balls Algorithm -- 4.1 Decoding up to the Minimum Lee Distance -- 4.2 Decoding Beyond the Minimum Distance -- 5 Comparison -- Appendix A Asymptotics -- Appendix A.1 Asymptotics of Lee Spheres</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Appendix B Proofs of Lemma 4 and 7 -- References -- Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 m-block Codes -- 2.2 Subfield Images of Codes -- 2.3 Generalized Reed-Solomon Codes -- 3 Ivanov-Krouk-Zyablov Cryptosystem -- 3.1 Protocol Description -- 3.2 Message-Recovery Attack -- 4 Direct Key-Recovery Attack -- 4.1 Case of Even k -- 4.2 Case of Odd k -- 5 Twisted Squares-Based Attack -- 5.1 Recovering the Support x -- 5.2 Recovering the Matrix Q -- 6 Conclusion -- References -- Author Index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory-Congresses</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2022</subfield><subfield code="z">Trondheim ; Online</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Deneuville, Jean-Christophe</subfield><subfield code="t">Code-Based Cryptography</subfield><subfield code="d">Cham : Springer,c2023</subfield><subfield code="z">9783031296888</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035212402</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/hwr/detail.action?docID=7221120</subfield><subfield code="l">DE-2070s</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">HWR_PDA_PQE</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2022 Trondheim ; Online gnd-content |
| genre_facet | Konferenzschrift 2022 Trondheim ; Online |
| id | DE-604.BV049872944 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T19:04:04Z |
| institution | BVB |
| isbn | 9783031296895 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035212402 |
| oclc_num | 1379626454 |
| open_access_boolean | |
| owner | DE-2070s |
| owner_facet | DE-2070s |
| physical | 1 Online-Ressource (163 Seiten) |
| psigel | ZDB-30-PQE ZDB-30-PQE HWR_PDA_PQE |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer |
| record_format | marc |
| series2 | Lecture Notes in Computer Science Series |
| spelling | Deneuville, Jean-Christophe Verfasser aut Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers 1st ed Cham Springer 2023 ©2023 1 Online-Ressource (163 Seiten) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science Series v.13839 Description based on publisher supplied metadata and other sources Intro -- Preface -- Organization -- Contents -- Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 The Sum-Rank Metric -- 2.2 Automorphisms, Derivations, and Conjugacy -- 2.3 Isometries in the Sum-Rank Metric -- 2.4 Skew Polynomials -- 2.5 (Generalized) Linearized Reed-Solomon Codes -- 3 Problem Statement -- 4 Distinguishers for GLRS Codes -- 4.1 A Square-Code Distinguisher -- 4.2 An Overbeck-Like Distinguisher -- 5 Recovery of a Canonical Generator Matrix -- 5.1 Square-Code Approach -- 5.2 Overbeck-Like Approach -- 6 Conclusion -- References -- Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions Towards Classic McEliece Implementation Verification -- 2 Our Toolchain and Its Target -- 3 Verifying Classic McEliece with SAW/Cryptol -- 3.1 Verification Details -- 4 Verifying Aspects of Classic McEliece with Lean -- 5 Conclusions and Perspectives -- 5.1 Recommendations -- 5.2 Future Work Using Similar Approaches -- References -- Key-Recovery Fault Injection Attack on the Classic McEliece KEM -- 1 Introduction -- 2 Classic McEliece KEM -- 2.1 Key Generation -- 2.2 Encapsulation -- 2.3 Decapsulation -- 2.4 Implementation -- 3 Key-Recovery Attack -- 3.1 Fault Model -- 3.2 Fault Attack on the Validity Checks (VCB) -- 3.3 Fault Attack on the ELP Coefficients -- 3.4 Computing Alternative Secret Keys -- 4 Fault Attack Implementation and Simulation -- 4.1 Key-Recovery Simulation -- 4.2 De-hashing: Obtaining the Faulty Error Vector from Hash Output -- 4.3 Simulation at Register Transfer Level -- 5 Summary -- A Appendix -- A.1 Classic McEliece KEM Algorithms and Parameters -- References -- Towards Automating Cryptographic Hardware Implementations: A Case Study of HQC. 1 Introduction -- 1.1 Design Artifacts -- 1.2 Outline of the Paper -- 2 Preliminaries and Background -- 2.1 Notations -- 2.2 Background on HQC -- 3 HLS Design Implementation of the HQC -- 3.1 HLS Implementation: Basics -- 3.2 Methodology and Implementation -- 4 Results and Comparisons -- 4.1 Target Settings -- 4.2 Synthesis Results -- 4.3 Modular Comparisons Among Different Versions -- 4.4 Comparisons with Software Implementations -- 4.5 Comparison with State-of-art Hardware Implementations -- 5 Conclusions -- References -- Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes -- 1 Introduction -- 2 Prerequisites -- 2.1 Notations -- 2.2 Coding Theory -- 2.3 Key Encapsulation Mechanism -- 3 KEM from Binary QD-GS Codes -- 3.1 Description -- 3.2 Security Analysis -- 4 Efficient Implementation -- 4.1 Implementation Details -- 4.2 Results -- 5 Conclusion -- References -- On Decoding High-Order Interleaved Sum-Rank-Metric Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Sum-Rank-Metric Codes -- 2.2 Interleaved Sum-Rank-Metric Codes and Channel Model -- 3 Decoding of High-Order Interleaved Sum-Rank-Metric Codes -- 3.1 The Error Support -- 3.2 Recovering the Error Support -- 3.3 A Metzner-Kapturowski-Like Decoding Algorithm -- 4 Implications for Decoding High-Order Interleaved Skew-Metric Codes -- 5 Comparison of Metzner-Kapturowski-Like Decoders in the Hamming, Rank and Sum-Rank Metric -- 6 Conclusion -- References -- Information Set Decoding for Lee-Metric Codes Using Restricted Balls -- 1 Introduction -- 2 Preliminaries -- 3 Distribution of a Random Lee Vector -- 4 Restricted-Balls Algorithm -- 4.1 Decoding up to the Minimum Lee Distance -- 4.2 Decoding Beyond the Minimum Distance -- 5 Comparison -- Appendix A Asymptotics -- Appendix A.1 Asymptotics of Lee Spheres Appendix B Proofs of Lemma 4 and 7 -- References -- Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 m-block Codes -- 2.2 Subfield Images of Codes -- 2.3 Generalized Reed-Solomon Codes -- 3 Ivanov-Krouk-Zyablov Cryptosystem -- 3.1 Protocol Description -- 3.2 Message-Recovery Attack -- 4 Direct Key-Recovery Attack -- 4.1 Case of Even k -- 4.2 Case of Odd k -- 5 Twisted Squares-Based Attack -- 5.1 Recovering the Support x -- 5.2 Recovering the Matrix Q -- 6 Conclusion -- References -- Author Index Coding theory-Congresses (DE-588)1071861417 Konferenzschrift 2022 Trondheim ; Online gnd-content Erscheint auch als Druck-Ausgabe Deneuville, Jean-Christophe Code-Based Cryptography Cham : Springer,c2023 9783031296888 |
| spellingShingle | Deneuville, Jean-Christophe Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers Intro -- Preface -- Organization -- Contents -- Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 The Sum-Rank Metric -- 2.2 Automorphisms, Derivations, and Conjugacy -- 2.3 Isometries in the Sum-Rank Metric -- 2.4 Skew Polynomials -- 2.5 (Generalized) Linearized Reed-Solomon Codes -- 3 Problem Statement -- 4 Distinguishers for GLRS Codes -- 4.1 A Square-Code Distinguisher -- 4.2 An Overbeck-Like Distinguisher -- 5 Recovery of a Canonical Generator Matrix -- 5.1 Square-Code Approach -- 5.2 Overbeck-Like Approach -- 6 Conclusion -- References -- Verifying Classic McEliece: Examining the Role of Formal Methods in Post-Quantum Cryptography Standardisation -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions Towards Classic McEliece Implementation Verification -- 2 Our Toolchain and Its Target -- 3 Verifying Classic McEliece with SAW/Cryptol -- 3.1 Verification Details -- 4 Verifying Aspects of Classic McEliece with Lean -- 5 Conclusions and Perspectives -- 5.1 Recommendations -- 5.2 Future Work Using Similar Approaches -- References -- Key-Recovery Fault Injection Attack on the Classic McEliece KEM -- 1 Introduction -- 2 Classic McEliece KEM -- 2.1 Key Generation -- 2.2 Encapsulation -- 2.3 Decapsulation -- 2.4 Implementation -- 3 Key-Recovery Attack -- 3.1 Fault Model -- 3.2 Fault Attack on the Validity Checks (VCB) -- 3.3 Fault Attack on the ELP Coefficients -- 3.4 Computing Alternative Secret Keys -- 4 Fault Attack Implementation and Simulation -- 4.1 Key-Recovery Simulation -- 4.2 De-hashing: Obtaining the Faulty Error Vector from Hash Output -- 4.3 Simulation at Register Transfer Level -- 5 Summary -- A Appendix -- A.1 Classic McEliece KEM Algorithms and Parameters -- References -- Towards Automating Cryptographic Hardware Implementations: A Case Study of HQC. 1 Introduction -- 1.1 Design Artifacts -- 1.2 Outline of the Paper -- 2 Preliminaries and Background -- 2.1 Notations -- 2.2 Background on HQC -- 3 HLS Design Implementation of the HQC -- 3.1 HLS Implementation: Basics -- 3.2 Methodology and Implementation -- 4 Results and Comparisons -- 4.1 Target Settings -- 4.2 Synthesis Results -- 4.3 Modular Comparisons Among Different Versions -- 4.4 Comparisons with Software Implementations -- 4.5 Comparison with State-of-art Hardware Implementations -- 5 Conclusions -- References -- Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes -- 1 Introduction -- 2 Prerequisites -- 2.1 Notations -- 2.2 Coding Theory -- 2.3 Key Encapsulation Mechanism -- 3 KEM from Binary QD-GS Codes -- 3.1 Description -- 3.2 Security Analysis -- 4 Efficient Implementation -- 4.1 Implementation Details -- 4.2 Results -- 5 Conclusion -- References -- On Decoding High-Order Interleaved Sum-Rank-Metric Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Sum-Rank-Metric Codes -- 2.2 Interleaved Sum-Rank-Metric Codes and Channel Model -- 3 Decoding of High-Order Interleaved Sum-Rank-Metric Codes -- 3.1 The Error Support -- 3.2 Recovering the Error Support -- 3.3 A Metzner-Kapturowski-Like Decoding Algorithm -- 4 Implications for Decoding High-Order Interleaved Skew-Metric Codes -- 5 Comparison of Metzner-Kapturowski-Like Decoders in the Hamming, Rank and Sum-Rank Metric -- 6 Conclusion -- References -- Information Set Decoding for Lee-Metric Codes Using Restricted Balls -- 1 Introduction -- 2 Preliminaries -- 3 Distribution of a Random Lee Vector -- 4 Restricted-Balls Algorithm -- 4.1 Decoding up to the Minimum Lee Distance -- 4.2 Decoding Beyond the Minimum Distance -- 5 Comparison -- Appendix A Asymptotics -- Appendix A.1 Asymptotics of Lee Spheres Appendix B Proofs of Lemma 4 and 7 -- References -- Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem -- 1 Introduction -- 2 Preliminaries -- 2.1 m-block Codes -- 2.2 Subfield Images of Codes -- 2.3 Generalized Reed-Solomon Codes -- 3 Ivanov-Krouk-Zyablov Cryptosystem -- 3.1 Protocol Description -- 3.2 Message-Recovery Attack -- 4 Direct Key-Recovery Attack -- 4.1 Case of Even k -- 4.2 Case of Odd k -- 5 Twisted Squares-Based Attack -- 5.1 Recovering the Support x -- 5.2 Recovering the Matrix Q -- 6 Conclusion -- References -- Author Index Coding theory-Congresses |
| subject_GND | (DE-588)1071861417 |
| title | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_auth | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_exact_search | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_full | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_fullStr | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_full_unstemmed | Code-Based Cryptography 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| title_short | Code-Based Cryptography |
| title_sort | code based cryptography 10th international workshop cbcrypto 2022 trondheim norway may 29 30 2022 revised selected papers |
| title_sub | 10th International Workshop, CBCrypto 2022, Trondheim, Norway, May 29-30, 2022, Revised Selected Papers |
| topic | Coding theory-Congresses |
| topic_facet | Coding theory-Congresses Konferenzschrift 2022 Trondheim ; Online |
| work_keys_str_mv | AT deneuvillejeanchristophe codebasedcryptography10thinternationalworkshopcbcrypto2022trondheimnorwaymay29302022revisedselectedpapers |