A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
Date
2024-02Author
Yusof, SN
Kamel Ariffin, MR
Yip, S-C
Lau, TSC
Mahad, Z
Chin, J-J
Ting, C-Y
Metadata
Show full item recordAbstract
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.
Collections
Publisher
Elsevier BV
Journal
Heliyon
Volume
10
Issue
4
Pagination
e25470-e25470
Number
e25470
Recommended, similar items
The following license files are associated with this item: