HAL (France)
open access
Algorithms for the cryptanalysis of code-based cryptographic schemes
This thesis studies the cryptanalysis of code-based cryptographic constructions through two fundamental algorithmic problems: the nearest neighbor problem and the Quasi-Abelian Syndrome Decoding (QA-SD) problem, both of which arise in recent post-quantum cryptographic schemes. The first contribution
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On neighbor distances and symmetry in group codes#490081
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids#1200268
- Report on Post-Quantum Cryptography#199374
- Dualities of dihedral and generalised quaternion codes and applications to quantum codes#973003
Record · ID 1312590
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive