On the equivalence of two post-quantum cryptographic families
CC BY
Lưu vào:
| Tác giả chính: | , , |
|---|---|
| Định dạng: | Sách |
| Ngôn ngữ: | English |
| Nhà xuất bản: |
Springer
2023
|
| Chủ đề: | |
| Truy cập trực tuyến: | https://link.springer.com/article/10.1007/s10231-022-01267-x https://dlib.phenikaa-uni.edu.vn/handle/PNK/7431 |
| Từ khóa: |
Thêm từ khóa
Không có từ khóa, Hãy là người đầu tiên đánh dấu biểu ghi này!
|
| id |
oai:localhost:PNK-7431 |
|---|---|
| record_format |
dspace |
| spelling |
oai:localhost:PNK-74312023-04-03T06:59:10Z On the equivalence of two post-quantum cryptographic families Alessio, Meneghetti Alex, Pellegrini Massimiliano, Sala maximum likelihood decoding problem NP-hard CC BY 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. 2023-04-03T06:59:09Z 2023-04-03T06:59:09Z 2022 Book https://link.springer.com/article/10.1007/s10231-022-01267-x https://dlib.phenikaa-uni.edu.vn/handle/PNK/7431 en application/pdf Springer |
| institution |
Digital Phenikaa |
| collection |
Digital Phenikaa |
| language |
English |
| topic |
maximum likelihood decoding problem NP-hard |
| spellingShingle |
maximum likelihood decoding problem NP-hard Alessio, Meneghetti Alex, Pellegrini Massimiliano, Sala On the equivalence of two post-quantum cryptographic families |
| description |
CC BY |
| format |
Book |
| author |
Alessio, Meneghetti Alex, Pellegrini Massimiliano, Sala |
| author_facet |
Alessio, Meneghetti Alex, Pellegrini Massimiliano, Sala |
| author_sort |
Alessio, Meneghetti |
| title |
On the equivalence of two post-quantum cryptographic families |
| title_short |
On the equivalence of two post-quantum cryptographic families |
| title_full |
On the equivalence of two post-quantum cryptographic families |
| title_fullStr |
On the equivalence of two post-quantum cryptographic families |
| title_full_unstemmed |
On the equivalence of two post-quantum cryptographic families |
| title_sort |
on the equivalence of two post-quantum cryptographic families |
| publisher |
Springer |
| publishDate |
2023 |
| url |
https://link.springer.com/article/10.1007/s10231-022-01267-x https://dlib.phenikaa-uni.edu.vn/handle/PNK/7431 |
| _version_ |
1762184303170551808 |
| score |
8.891145 |