Cryptanalysis Attacks on Multi Prime Power Modulus Through Analyzing Prime Difference

Abstract

The Security of Rivest, Shamir and Adleman Cryptosystem known as RSA and its variants rely on the difficulty of integer factorization problem. This  paper presents a short decryption exponent attack on RSA variant  based on the key equation    where prime difference was carefully analyzed and came up with an approximation of  as   which enabled us to obtain an improved bound  that led to the polynomial time factorization of the variant .