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

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

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

Full description

Bibliographic Details
Main Authors: Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nur Raidah Salim, Sook-Chin Yip, Timothy Tzen Vun Yap
Format: Article
Language:English
Published: MDPI AG 2023-03-01
Series:Axioms
Subjects:
Polynomial Reconstruction Problem
post-quantum cryptography
Indistinguishable Chosen-Plaintext Attack
<title>MSC</title>
94A60
11T71
Online Access:https://www.mdpi.com/2075-1680/12/3/304

Internet

https://www.mdpi.com/2075-1680/12/3/304

Similar Items