The code equivalence problem and its applications to cryptography
From MaRDI portal
Cites work
- A new formulation of the linear equivalence problem and shorter less signatures
- An Improved Claw Finding Algorithm Using Quantum Walk
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Computing automorphism groups of error-correcting codes
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Cryptographic group actions and applications
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Does co-NP have short interactive proofs ?
- Enumeration of the semilinear isometry classes of linear codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Fundamentals of Error-Correcting Codes
- Graph isomorphism in quasipolynomial time (extended abstract)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Is code equivalence easy to decide?
- LESS is more: code-based signatures without syndromes
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- On the computational hardness of the code equivalence problem in cryptography
- On the Dimension of the Hull
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Public key cryptography based on semigroup actions
- Quantum information set decoding algorithms
- Representations of group actions and their applications in cryptography
This page was built for publication: The code equivalence problem and its applications to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965835)
