ORCID
- Ji Jian Chin: 0000-0001-9809-6976
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.
DOI
10.1016/j.heliyon.2024.e25470
Publication Date
2024-02-29
Publication Title
Heliyon
Volume
10
Issue
4
ISSN
2405-8440
Keywords
Bivariate polynomial, Decryption failure, Polynomial reconstruction problem, Post-quantum cryptography, Univariate polynomial
Recommended Citation
Kamel Ariffin, M., Yip, S., Yusof, S., Lau, T., Mahad, Z., Chin, J., & Ting, C. (2024) 'A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem', Heliyon, 10(4). Available at: https://doi.org/10.1016/j.heliyon.2024.e25470
