TY - JOUR
T1 - An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
AU - Yusof, Siti Nabilah
AU - Ariffin, Muhammad Rezal Kamel
AU - Lau, Terry Shue Chien
AU - Salim, Nur Raidah
AU - Yip, Sook Chin
AU - Yap, Timothy Tzen Vun
N1 - Funding Information:
The first author would like to further express appreciation to Institute for Mathematical Research (INSPEM), Universiti Putra Malaysia (UPM) and Ministry of Higher Education (MOHE) for giving the opportunity to conduct this research.
Funding Information:
The research was supported by the Ministry of Higher Education Malaysia through the Fundamental Research Grant Scheme (FRGS/1/2019/STG06/UPM/02/8). It was also partially supported by the Mediterranea Universiti of Reggio Calabria (UNIRC) Research Grant (UPM/INSPEM/ 700-3/1/GERAN ANTARABANGSA/6380071–10065). The results of Terry Shue Chien Lau were supported by the MMU Postdoc (MMUI/220141).
Publisher Copyright:
© 2023 by the authors.
PY - 2023/3/17
Y1 - 2023/3/17
N2 - 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).
AB - 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).
KW - Indistinguishable Chosen-Plaintext Attack
KW - Polynomial Reconstruction Problem
KW - post-quantum cryptography
UR - http://www.scopus.com/inward/record.url?scp=85151127485&partnerID=8YFLogxK
U2 - 10.3390/axioms12030304
DO - 10.3390/axioms12030304
M3 - Article
AN - SCOPUS:85151127485
SN - 2075-1680
VL - 12
JO - Axioms
JF - Axioms
IS - 3
M1 - 304
ER -