.png){kind=icon}
返回
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
.png){kind=icon}
OA
AI
DOI：10.1016/j.heliyon.2024.e25470.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In 1999, the Polynomial Reconstruction Problem (PRP) was put forward as a new hard mathematics problem. A univariate PRP scheme by Augot and Finiasz was introduced at Eurocrypt in 2003, and this cryptosystem was fully cryptanalyzed in 2004. In 2013, a bivariate PRP cryptosystem was developed, which is a modified version of Augot and Finiasz's original work. This study describes a decryption failure that can occur in both cryptosystems. We demonstrate that when the error has a weight greater than the number of monomials in a secret polynomial, p, decryption failure can occur. The result of this study also determines the upper bound that should be applied to avoid decryption failure.
Keyword:
Polynomial reconstruction problem
Post-quantum cryptography
Decryption failure
Univariate polynomial
Bivariate polynomial
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
3.8W
被引数:
10.5W
机构
引用论文
分享收藏LRSPPP: lightweight R-LWE-based secure and privacy-preserving scheme for prosumer side network in smart grid.png)
HELIYONOAAI
HELIYONIF3.6
OAAI分享收藏An efficient and secure compression technique for data protection using burrows-wheeler transform algorithmHELIYONOAAI
HELIYONIF3.6
OAAI分享收藏Relevance of iodine intake as a reputed predisposing factor for thyroid cancer碘摄入量与甲状腺癌的易感因素的相关性OAAI
OAAI分享收藏
A Flexible and High-Performance Lattice-Based Post-Quantum Crypto Secure Coprocessor一种灵活、高性能的基于格的后量子加密安全协处理器
PREAI
分享收藏
查看更多内容