This algorithm is known as the Son of the Tsars Algorithm and is donated into the public domain.
Chose any 2 primes such that a=b=5 mod 12. Let n= a mod b and x=plaintext and c=cyphertext.
c=x^3 mod n and x=c^((a+1)/6) mod n=c^((b+1)/6) mod n. This algorithm is faster than the Rabin and could compete with the RSA.