Algebraic attacks for the rank decoding problem
Gespeichert in:
| Titel: | Algebraic attacks for the rank decoding problem |
|---|---|
| Autoren: | Bardet, Magali |
| Weitere Verfasser: | Equipe Combinatoire et algorithmes (LITIS - CA), Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université Le Havre Normandie (ULH), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), ANR-22-PETQ-0008,PQ-TLS,Post-quantum padlock for web browser(2022) |
| Quelle: | https://hal.science/hal-04986106 ; École thématique. Journées Nationales de Calcul Formel, CIRM, Luminy, Marseille, France. 2024 ; Journées Nationales de Calcul Formel. |
| Verlagsinformationen: | CCSD |
| Publikationsjahr: | 2024 |
| Schlagwörter: | Gröbner bases, MinRank problem, Algebraic attack, Rank-metric decoding problems, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] |
| Geographisches Schlagwort: | CIRM, Luminy, Marseille, France |
| Beschreibung: | École thématique ; Algebraic cryptanalysis has become unavoidable in the cryptanalysis and design of schemes in cryptography. In the first part, I explain what is a good algebraic modeling, and how we can estimate the complexity of solving a polynomial system with Gröbner basis. In the second part, I present different algebraic modelings for the decoding problem in rank metric code-based cryptography, and their complexity analysis. |
| Publikationsart: | lecture |
| Sprache: | English |
| DOI: | 10.24350/CIRM.V.20148503 |
| Verfügbarkeit: | https://hal.science/hal-04986106 https://hal.science/hal-04986106v1/document https://hal.science/hal-04986106v1/file/Bardet-part1.pdf https://doi.org/10.24350/CIRM.V.20148503 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Dokumentencode: | edsbas.A722C3BD |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | École thématique ; Algebraic cryptanalysis has become unavoidable in the cryptanalysis and design of schemes in cryptography. In the first part, I explain what is a good algebraic modeling, and how we can estimate the complexity of solving a polynomial system with Gröbner basis. In the second part, I present different algebraic modelings for the decoding problem in rank metric code-based cryptography, and their complexity analysis. |
|---|---|
| DOI: | 10.24350/CIRM.V.20148503 |