Cover Image

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

Full description

Saved in:
Bibliographic Details
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!
id my.upm.eprints.106177
record_format eprints
spelling my.upm.eprints.1061772024-11-11T06:45:39Z http://psasir.upm.edu.my/id/eprint/106177/ A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem Yusof, Siti Nabilah Kamel Ariffin, Muhammad Rezal Yip, Sook-Chin Lau, Terry Shue Chien Mahad, Zahari Chin, Ji-Jian Ting, Choo-Yee 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 is a modified version of Augot and Finiasz's original work. This study describes a decryption failure that can occur in both cryptosystems. We demonstrate that when the error has a weight greater than the number of monomials in a secret polynomial, p, decryption failure can occur. The result of this study also determines the upper bound that should be applied to avoid decryption failure. Elsevier Ltd 2024 Article PeerReviewed text en cc_by_nc_nd_4 http://psasir.upm.edu.my/id/eprint/106177/1/106177.pdf Yusof, Siti Nabilah and Kamel Ariffin, Muhammad Rezal and Yip, Sook-Chin and Lau, Terry Shue Chien and Mahad, Zahari and Chin, Ji-Jian and Ting, Choo-Yee (2024) A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem. Heliyon, 10 (4). art. no. e25470. ISSN 2405-8440; eISSN: 2405-8440 https://linkinghub.elsevier.com/retrieve/pii/S2405844024015019 10.1016/j.heliyon.2024.e25470
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description 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 is a modified version of Augot and Finiasz's original work. This study describes a decryption failure that can occur in both cryptosystems. We demonstrate that when the error has a weight greater than the number of monomials in a secret polynomial, p, decryption failure can occur. The result of this study also determines the upper bound that should be applied to avoid decryption failure.
format Article
author Yusof, Siti Nabilah
Kamel Ariffin, Muhammad Rezal
Yip, Sook-Chin
Lau, Terry Shue Chien
Mahad, Zahari
Chin, Ji-Jian
Ting, Choo-Yee
spellingShingle Yusof, Siti Nabilah
Kamel Ariffin, Muhammad Rezal
Yip, Sook-Chin
Lau, Terry Shue Chien
Mahad, Zahari
Chin, Ji-Jian
Ting, Choo-Yee
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
author_facet Yusof, Siti Nabilah
Kamel Ariffin, Muhammad Rezal
Yip, Sook-Chin
Lau, Terry Shue Chien
Mahad, Zahari
Chin, Ji-Jian
Ting, Choo-Yee
author_sort Yusof, Siti Nabilah
title A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
title_short A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
title_full A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
title_fullStr A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
title_full_unstemmed A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
title_sort failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
publisher Elsevier Ltd
publishDate 2024
url 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
_version_ 1816132696996315136
score 13.223943

Similar Items