Asset Details
Do you wish to reserve the book?
An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
Do you wish to request the book?
An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
2023
Overview
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).
Publisher
MDPI AG
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.