Indian Journal of Science and Technology
DOI: 10.17485/ijst/2017/v10i1/109314
Year: 2016, Volume: 9, Issue: Special Issue 1, Pages: 1-5
Original Article
Muhammad Asyraf Asbullah1 and Muhammad Rezal Kamel Ariffin2
1 Al-Kindi Cryptography Research Laboratory, Institute for Mathematical Research (INSPEM), Universiti Putra Malaysia;
2 Mathematics Department, Faculty of Science, Universiti Putra Malaysia;
Objective: In this paper, we present two algebraic analyses upon a new Rabin-like public key cryptosystem namely the Rabin-p cryptosystem. Methods/Analysis: We show that by using the continued fraction’s method and the Coppersmith’s theorems, there exists inappropriate parameter’s size that can affect the security of Rabin-p cryptosystem. Findings: The first analysis proved that the prime factors of its public key can be found amongst the list of the continued fraction expansion of the ciphertext c and the modulus N=p2 q in polynomial time. For the second analysis, by using the Coppersmith’s theorems we showed that the message m can be retrieved in polynomial time provided some condition on the message length. We also propose a countermeasure to avoid both analyses. Novelty/Improvement: The purpose of this work is to offer suggestions for a countermeasure for the aforementioned analysis upon implementing the Rabin-p cryptosystem. Hence, all the parameters should be chosen carefully
Keywords: Algebraic Analysis, Continued Fraction, Coppersmith’s Theorems, Rabin-p Cryptosystem
Subscribe now for latest articles and news.