FACTORING VIA SUPERENCYRPTION
Shimshon Berkovits · Cryptologia · 1982
It is shown that a Simmons and Norris cycling attack against an RSA public key cryptosystem can be modified to search for factors of the modulus of the system. The cycling can be accomplished by superencyrption or by repeated applications of a function chosen by the cryptanalyst. Finally, the safest choice of system parameters is discussed.