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). e25470. ISSN 2405-8440

Text 9.pdf - Published Version Restricted to Repository staff only Download (355kB)

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,

Item Type:	Article
Uncontrolled Keywords:	Polynomial
Subjects:	Q Science > QA Mathematics > QA150-272.5 Algebra
Divisions:	Faculty of Computing and Informatics (FCI) Faculty of Engineering (FOE)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	04 Mar 2024 01:38
Last Modified:	04 Mar 2024 01:38
URII:	http://shdl.mmu.edu.my/id/eprint/12145

Downloads

Edit (login required)