Originally posted here by Overlord_77520
Whenever you see the term mod it means the remainder you were taught in school. For example, 6 divided by 7 equals 0 remainder 6. SO let us choose primes 137 and 89. Both have remainder 5 when divided by twelve. The modulo of 137 to 89 is 48.

Let us choose plaintext value 13. Take 15 to the 15 power (89+1)/6=15. (I switched the encryption and decryption algorithms, sorry.) and take the remainder of that divided by 48. You get 32. Take 32^3 mod 48 and you get 15.
I think the concern here is that people are not going to use the algorithm you supplied because it is free. What proof is there that this is a good algorithm?

I am not going to say it isn't, just prove to us it is using more than that.

-Deeboe