A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
In 1999, the Polynomial Reconstruction Problem (PRP) was put forward as a new hard mathematics problem. A univariate PRP scheme by Augot and Finiasz was introduced at Eurocrypt in 2003, and this cryptosystem was fully cryptanalyzed in 2004. In 2013, a bivariate PRP cryptosystem was developed, which...
Saved in:
Main Authors: | Yusof, Siti Nabilah, Kamel Ariffin, Muhammad Rezal, Yip, Sook-Chin, Lau, Terry Shue Chien, Mahad, Zahari, Chin, Ji-Jian, Ting, Choo-Yee |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier Ltd
2024
|
Online Access: | http://psasir.upm.edu.my/id/eprint/106177/1/106177.pdf http://psasir.upm.edu.my/id/eprint/106177/ https://linkinghub.elsevier.com/retrieve/pii/S2405844024015019 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient methods to overcome Rabin cryptosystem decryption failure
by: Mahad, Zahari, et al.
Published: (2017) -
Design of Rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016) -
Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015) -
Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014) -
Fast decryption method for a Rabin primitive-based cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)