Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)

DOI10.1007/978-3-030-81652-0_15zbMath1485.94131OpenAlexW3186070374MaRDI QIDQ832357

Ward Beullens

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_15

zbMATH Keywords

code-based cryptographypost-quantum cryptographylinear code equivalence problempermutation code equivalence problem

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

Hull attacks on the lattice isomorphism problem ⋮ On the computational hardness of the code equivalence problem in cryptography ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ An attack on a non-interactive key exchange from code equivalence ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ Graph-theoretic algorithms for the alternating trilinear form equivalence problem ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures

Uses Software

• McEliece
• Durandal

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel collision search with cryptanalytic applications
• Improved identification schemes based on error-correcting codes
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
• Durandal: a rank metric based signature scheme
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Computing automorphism groups of error-correcting codes
• A new identification scheme based on syndrome decoding
• 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

This page was built for publication: Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)