On the equivalence of two post-quantum cryptographic families

Alessio Meneghetti, Alex Pellegrini, Massimiliano Sala

The Maximum Likelihood Decoding Problem (MLD) is known to be NP-hard and its complexity is strictly related to the security of some post-quantum cryptosystems, that is, the so-call…