Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Alessio, Meneghetti | - |
| dc.contributor.author | Alex, Pellegrini | - |
| dc.contributor.author | Massimiliano, Sala | - |
| dc.date.accessioned | 2023-04-03T06:59:09Z | - |
| dc.date.available | 2023-04-03T06:59:09Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s10231-022-01267-x | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7431 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | 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. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | maximum likelihood decoding problem | vi |
| dc.subject | NP-hard | vi |
| dc.title | On the equivalence of two post-quantum cryptographic families | vi |
| dc.type | Book | vi |
| Appears in Collections | ||
| OER - Khoa học Tự nhiên | ||
Files in This Item:
