On the computational hardness of the code equivalence problem in cryptography
From MaRDI portal
Recommendations
- The hardness of code equivalence over F_q and its application to code-based cryptography
- A NP-complete problem in coding theory with application to code based cryptography
- scientific article; zbMATH DE number 2086625
- On constructing homomorphic encryption schemes from coding theory
- On the complexity of some cryptographic problems based on the general decoding problem
- scientific article; zbMATH DE number 503190
- On computational complexity of impossible differential cryptanalysis
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Security bounds for the design of code-based cryptosystems
- On the homomorphic computation of symmetric cryptographic primitives
Cites work
- Computing automorphism groups of error-correcting codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Graph isomorphism in quasipolynomial time (extended abstract)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Information-set decoding for linear codes over F_q
- Is code equivalence easy to decide?
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- 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 Dimension of the Hull
- The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
Cited in
(28)- scientific article; zbMATH DE number 1256714 (Why is no real title available?)
- The hardness of code equivalence over F_q and its application to code-based cryptography
- Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
- Hardness estimates of the code equivalence problem in the rank metric
- Take your MEDS: digital signatures from matrix code equivalence
- A High-Performance Hardware Implementation of the LESS Digital Signature Scheme
- \textsf{FuLeeca}: a Lee-based signature scheme
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Code-based secret handshake scheme, revisited
- Monomial isomorphism for tensors and applications to code equivalence problems
- Non-interactive commitment from non-transitive group actions
- A new formulation of the linear equivalence problem and shorter less signatures
- Representations of group actions and their applications in cryptography
- Cutting the GRASS: threshold group action signature schemes
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Coding properties and automorphism groups of two classes of twisted generalized Reed-Solomon codes
- On linear equivalence, canonical forms, and digital signatures
- On the sample complexity of linear code equivalence for all code rates
- Don't use it twice! Solving relaxed linear equivalence problems
- The code equivalence problem and its applications to cryptography
- An improved algorithm for code equivalence
- Relating code equivalence to other isomorphism problems
- Invariants for sum-rank metric codes
- A survey on code equivalence: the state-of-the-art and open questions
- Two is all it takes: asymptotic and concrete improvements for solving code equivalence
- VOLE-in-the-head signatures based on the linear code equivalence problem
- On the security of two blind signatures from code equivalence problems
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
This page was built for publication: On the computational hardness of the code equivalence problem in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112221)
