Computational hardness of the permuted kernel and subcode equivalence problems

DOI10.1109/TIT.2023.3323068MaRDI QIDQ6576124zbMATH OpenFDO

Authors Paolo Santini, Marco Baldi, Franco Chiaraluce

Publication date 22 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3323068

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(5)

• On the number of solutions to a random instance of the permuted kernel problem
• Don't use it twice! Solving relaxed linear equivalence problems
• The matrix subcode equivalence problem and its application to signature with MPC-in-the-head
• Recursion enabled: improved cryptanalysis of the permuted kernel problem
• A survey on code equivalence: the state-of-the-art and open questions

This page was built for publication: Computational hardness of the permuted kernel and subcode equivalence problems

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