On the computational hardness of the code equivalence problem in cryptography
From MaRDI portal
Publication:6112221
DOI10.3934/amc.2022064zbMath1520.94039OpenAlexW4292209587WikidataQ114844110 ScholiaQ114844110MaRDI QIDQ6112221
Paolo Maria Santíni, Alessandro Barenghi, Edoardo Persichetti, Jean-François Biasse
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2022064
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (1)
Cites Work
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- LESS-FM: fine-tuning signatures from the code equivalence problem
- The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
- Information-Set Decoding for Linear Codes over F q
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Computing automorphism groups of error-correcting codes
- On the Dimension of the Hull
- Is code equivalence easy to decide?
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- LESS is More: Code-Based Signatures Without Syndromes
- Graph isomorphism in quasipolynomial time [extended abstract]
This page was built for publication: On the computational hardness of the code equivalence problem in cryptography
