A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem.
Heliyon
; 10(4): e25470, 2024 Feb 29.
Article
in En
| MEDLINE
| ID: mdl-38370193
ABSTRACT
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.
Full text:
1
Collection:
01-internacional
Database:
MEDLINE
Language:
En
Journal:
Heliyon
Year:
2024
Document type:
Article
Affiliation country:
Malasia
Country of publication:
Reino Unido