Citation

Yusof, Siti Nabilah and Kamel Ariffin, Muhammad Rezal and Lau, Terry Shue Chien and Salim, Nur Raidah and Yip, Sook Chin and Yap, Timothy Tzen Vun (2023) An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem. Axioms, 12 (3). p. 304. ISSN 2075-1680

Text axioms-12-00304.pdf - Published Version Restricted to Repository staff only Download (829kB)

Abstract

The Polynomial Reconstruction Problem (PRP) was introduced in 1999 as a new hard problem in post-quantum cryptography. Augot and Finiasz were the first to design a cryptographic system based on a univariate PRP, which was published at Eurocrypt 2003 and was broken in 2004. In 2013, a bivariate PRP was proposed. The design is a modified version of Augot and Finiasz’s design. Our strategic method, comprising the modified Berlekamp–Welch algorithm and Coron strategies, allowed us to obtain certain secret parameters of the bivariate PRP. This finding resulted in us concluding that the bivariate PRP is not secure against Indistinguishable Chosen-Plaintext Attack (IND-CPA).

Item Type:	Article
Uncontrolled Keywords:	Polynomial Reconstruction Problem; post-quantum cryptography; Indistinguishable Chosen-Plaintext Attack
Subjects:	Q Science > QC Physics > QC 1-75 General
Divisions:	Faculty of Engineering (FOE)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	02 May 2023 02:57
Last Modified:	02 May 2023 02:57
URII:	http://shdl.mmu.edu.my/id/eprint/11368

Downloads

Edit (login required)