SECURING THE RSA-CRYPTOSYSTEM AGAINST CYCLING ATTACKS
Peter Jamnig · Cryptologia · 1988
Starting with a critical review of an attack against the RSA encryption scheme proposed by Berkovits, this paper investigates the impact of the key numbers, i.e., primes and encryption exponent on the cycle lengths of permutations x \rightarrow x^{k} ({\rm mod} n), \quad (k, \phi(n)) = 1. It is shown that under certain conditions imposed on the primes, there is almost no chance for the Berkovits attack to succeed.