An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem

Autor:	Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nur Raidah Salim, Sook-Chin Yip, Timothy Tzen Vun Yap
Jazyk:	angličtina
Rok vydání:	2023
Předmět:	Polynomial Reconstruction Problem post-quantum cryptography Indistinguishable Chosen-Plaintext Attack MSC 94A60 11T71 Mathematics QA1-939
Zdroj:	Axioms, Vol 12, Iss 3, p 304 (2023)
Druh dokumentu:	article
ISSN:	2075-1680
DOI:	10.3390/axioms12030304
Popis:	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).
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/5deb407a58a04eaab4d1fea16d60461b Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.