Hardness estimates of the code equivalence problem in the rank metric

DOI10.1007/S10623-023-01338-XMaRDI QIDQ6130620zbMATH OpenFDO

Authors Krijn Reijnders, Simona Samardjiska, Monika Trimoska

Publication date 3 April 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

code equivalencepost-quantum cryptographyrank-based

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
• Is code equivalence easy to decide?
• Monomial isomorphism for tensors and applications to code equivalence problems
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• On the computational hardness of the code equivalence problem in cryptography

Cites work

• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1303122 (Why is no real title available?)
• scientific article; zbMATH DE number 3340304 (Why is no real title available?)
• scientific article; zbMATH DE number 3023391 (Why is no real title available?)
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• An Efficient Provable Distinguisher for HFE
• CLASSIFICATION PROBLEMS FOR SYSTEMS OF FORMS AND LINEAR MAPPINGS
• Computing automorphism groups of error-correcting codes
• Congruence of matrix spaces, matrix tuples, and multilinear maps
• Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
• Differential Cryptanalysis for Multivariate Schemes
• Field lifting for smaller UOV public keys
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Information-set decoding for linear codes over \(\mathbb F_q\)
• Isometries for rank distance and permutation group of gabidulin codes
• LESS is more: code-based signatures without syndromes
• LESS-FM: fine-tuning signatures from the code equivalence problem
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Rainbow, a New Multivariable Polynomial Signature Scheme
• SQISign: compact post-quantum signatures from quaternions and isogenies
• SeaSign: compact isogeny signatures from class group actions
• Structural cryptanalysis of McEliece schemes with compact keys
• Sum-rank product codes and bounds on the minimum distance
• The Magma algebra system. I: The user language
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• Wildness for tensors

Cited in

(2)

• Monomial isomorphism for tensors and applications to code equivalence problems
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants

This page was built for publication: Hardness estimates of the code equivalence problem in the rank metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130620)