Search

Current filters:

Current filters:

Author

Subject

Date issued

Has File(s)

Search Results

Results 1-1 of 1 (Search time: 0.0 seconds).
  • <<
  • 1
  • >>
    • On the equivalence of two post-quantum cryptographic families
    Authors: Alessio, Meneghetti; Alex, Pellegrini; Massimiliano, Sala;  Advisor: -;  Co-Author: - (2022)

    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-called code-based primitives. Analogously, the multivariate quadratic system problem (MQ) is NP-hard and its complexity is necessary for the security of the so-called multivariate-based primitives. In this paper we present a closed formula for a polynomial-time reduction from any instance of MLD to an instance of MQ, and viceversa. We also show a polynomial-time isomorphism between MQ and MLD, thus demonstrating the direct link between the two post-quantum cryptographic families.