A new formulation of the linear equivalence problem and shorter less signatures
From MaRDI portal
Publication:6595929
DOI10.1007/978-981-99-8739-9_12zbMATH Open1546.941MaRDI QIDQ6595929
Edoardo Persichetti, Paolo Santini
Publication date: 30 August 2024
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- An attack on a non-interactive key exchange from code equivalence
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Information-Set Decoding for Linear Codes over F q
- 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
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- LESS is More: Code-Based Signatures Without Syndromes
- On the computational hardness of the code equivalence problem in cryptography
- Take your MEDS: digital signatures from matrix code equivalence
Related Items (1)
This page was built for publication: A new formulation of the linear equivalence problem and shorter less signatures
