An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem-Reference-Cited by-同舟云学术

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

Published:2023-03-17 Issue:3 Volume:12 Page:304
ISSN:2075-1680
Container-title:Axioms
language:en
Short-container-title:Axioms

Author:

Yusof Siti Nabilah¹^ORCID,Kamel Ariffin Muhammad Rezal¹²,Lau Terry Shue Chien³,Salim Nur Raidah¹^ORCID,Yip Sook-Chin⁴^ORCID,Yap Timothy Tzen Vun³^ORCID

Affiliation:

1. Institute for Mathematical Research (INSPEM), Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia

2. Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia

3. Faculty of Computing and Informatics, Multimedia University, Cyberjaya 63100, Selangor, Malaysia

4. Faculty of Engineering, Multimedia University, Cyberjaya 63100, Selangor, Malaysia

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

Funder

Ministry of Higher Education Malaysia

Mediterranea Universiti of Reggio Calabria (UNIRC) Research

MMU Postdoc

Publisher

MDPI AG

Subject

Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis

Link

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

Reference25 articles.

1. Brassard, G., Lutkenhaus, N., Mor, T., and Sanders, B.C. (2000, January 14–18). Security Aspects of Practical Quantum Cryptography. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Bruges, Belgium.

2. Cambou, B., Gowanlock, M., Yildiz, B., Ghanaimiandoab, D., Lee, K., Nelson, S., Philabaum, C., Stenberg, A., and Wright, J. (2021). Post Quantum Cryptographic Keys Generated with Physical Unclonable Functions. Appl. Sci., 11.

3. Shor, P.W. (1994, January 20–22). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA.

4. Song, B., and Zhao, Y. (2017). Provably Secure Identity-Based Identification and Signature Schemes From Code Assumptions. PLoS ONE, 12.

5. An approach to cryptography based on continuous-variable quantum neural network;Shi;Sci. Rep.,2020

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem;Heliyon;2024-02

2. A Cognitive Comparative Analysis of Geometric Shape-Based Cryptosystem;Lecture Notes in Networks and Systems;2024