Computational hardness of the permuted kernel and subcode equivalence problems

DOI10.1109/TIT.2023.3323068zbMATH Open1547.94414MaRDI QIDQ6576124

Marco Baldi, Paolo Santini, Franco Chiaraluce

Publication date: 22 July 2024

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

On the number of solutions to a random instance of the permuted kernel problem

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)