.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Polynomial reconstruction problem
Post-quantum cryptography
Decryption failure
Univariate polynomial
Bivariate polynomial
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
3.8W
Citations:
10.5W
View more organizations