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

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).

Keywords

• Polynomial Reconstruction Problem
• post-quantum cryptography
• Indistinguishable Chosen-Plaintext Attack
• <title>MSC</title>
• 94A60
• 11T71