Citation
Yusof, Siti Nabilah and Kamel Ariffin, Muhammad Rezal and Yip, Sook-Chin and Lau, Terry Shue Chien and Mahad, Zahari and Chin, Ji-Jian and Ting, Choo-Yee
(2024)
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem.
Heliyon, 10 (4).
art. no. e25470.
ISSN 2405-8440; eISSN: 2405-8440
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.
Download File
Official URL or Download Paper: https://linkinghub.elsevier.com/retrieve/pii/S2405...
|
![[img]](http://psasir.upm.edu.my/style/images/fileicons/text.png)
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.1016/j.heliyon.2024.e25470 |
| Publisher: | Elsevier Ltd |
| Keywords: | Polynomial reconstruction problem; Post-quantum cryptography; Decryption failure; Univariate polynomial; Bivariate polynomial |
| Depositing User: | Mohamad Jefri Mohamed Fauzi |
| Date Deposited: | 11 Nov 2024 06:45 |
| Last Modified: | 11 Nov 2024 06:45 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.heliyon.2024.e25470 |
| URI: | http://psasir.upm.edu.my/id/eprint/106177 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |