A mathematical model for ascertaining same ciphertext generated from distinct plaintext in Michael O. Rabin Cryptosystem

Michael O. Rabin Cryptosystem can generate same ciphertext form different plaintext as well as multiple plaintext from single cyphertext. There are a number of techniues to reveal original plaintext. But none of them can seperate same cyphertext against each plaintext generated from modular reduction arithmetic. If question arises about how one can distinguish particular ciphertext against each plaintext, to answer those questions, I design a new mathematical model for identifying same ciphertext against each plaintext and it also facilitates message encryption and decryption. The proposed mathematical model constructiond based on quadratic root of quadratic residue, quadratic quotient, floor function and absolute value counting in order to identify the ciphertext against the plaintext. In particular. When same number of residues generated from multiple plaintext applying modular reduction arithmetic. The proposed crypto intensive technique uses symmetric key using Diffie-Hellman key exchange protocol. The advantage of proposed crypto intensive technique is intended receiver getting only one plainvalue distinguishing the ciphertext against the plaintext. The proposed crypto teachnique requires less time complexity and probabily secure against man-in-the-middle, chosen plaintext and cyphertext attack.