Hardness estimates of the code equivalence problem in the rank metric
From MaRDI portal
Publication:6130620
DOI10.1007/s10623-023-01338-xMaRDI QIDQ6130620
Monika Trimoska, Krijn Reijnders, Simona Samardjiska
Publication date: 3 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94Bxx) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural cryptanalysis of McEliece schemes with compact keys
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- The Magma algebra system. I: The user language
- Wildness for tensors
- Field lifting for smaller UOV public keys
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Sum-rank product codes and bounds on the minimum distance
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Congruence of matrix spaces, matrix tuples, and multilinear maps
- SeaSign: compact isogeny signatures from class group actions
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- Isometries for rank distance and permutation group of gabidulin codes
- Information-Set Decoding for Linear Codes over F q
- An Efficient Provable Distinguisher for HFE
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Rainbow, a New Multivariable Polynomial Signature Scheme
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- CLASSIFICATION PROBLEMS FOR SYSTEMS OF FORMS AND LINEAR MAPPINGS
- Computing automorphism groups of error-correcting codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- LESS is More: Code-Based Signatures Without Syndromes
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Differential Cryptanalysis for Multivariate Schemes
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
This page was built for publication: Hardness estimates of the code equivalence problem in the rank metric