Solving Ambiguity Problem of Rabin Cryptosystem With Geffe Generator
Udai Bhan Trivedi, Nayan Chitransh · 2018
Rabin [Rab79] utilises quadratic residue theory and its security which is as intractable as factoring to propose a public key encryption and digital signature. Rabin cryptosystem suffer from one major drawback, that it produces four possible cipher texts for single plain text; this will introduce the problem of ambiguity to find the corresponding plain message among four alternatives. In this paper we propose Geffe generator based Hash function which solve the ambiguity problem of plain text X. The disadvantage of this method is an extra information will be computed and send along with its cipher text from source to destination to specify the correct plain text. However, due to computation, its result in turn leads to additional computational cost. Finally this modification may also suffer the problem of collision in hashing.