COMPOSED MODULUS FOR RSA ALGORITHM

Otokar Grošek - Karol Nemoga - Ladislav Satko

   It is well known that there does not exist any polynomial time algorithm to prove primality of an integer although there are many sophisticated methods to do it with probability close to 1. We present a result concerning the case when a composed non square free integer m is in use providing gcd(s, f(m))=1.

Keywords: RSA, composed modulus

[full-paper]