Rabin encryption algorithm

Rabin algorithm is an asymmetric encryption algorithm based on Modulus square and square root of modulus.

0X01 encryption process set the private key p, Q is two prime, public key n=p*q. For clear text m and ciphertext C, define the following encryption procedure (Public Key cryptography procedure): The 0X02 decryption process calculates MP and MQ based on the following formula:
A usable YP and YQ are deduced according to the following formula:
The final result is calculated based on the following formula:
Can prove that each ciphertext corresponds to four original text, and the real original text generally need to according to the verification code to correspond.

Rabin encryption algorithm