On the sample complexity of linear code equivalence for all code rates

DOI10.1007/S12095-025-00790-XMaRDI QIDQ6950857zbMATH OpenFDO

Authors Alessandro Budroni, Andrea Natale

Publication date 30 July 2025

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-025-00790-X

zbMATH Keywords

code equivalencecryptanalysispost-quantum cryptographysample complexity

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Linear codes (general theory) (94B05)

Cites work

• Cutting the GRASS: threshold group action signature schemes
• Don't use it twice! Solving relaxed linear equivalence problems
• LESS is more: code-based signatures without syndromes
• On the computational hardness of the code equivalence problem in cryptography
• Representations of group actions and their applications in cryptography
• Updatable encryption from group actions

This page was built for publication: On the sample complexity of linear code equivalence for all code rates

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