Abstract
In this paper, we will study the method of attacking RSA on gaussian integer Since d is the inverse of e mod (N), we can figure out d if we know and the public key (the modulus n and the encryption exponent e) We can use the Extended Euclidean algorithm Knowing now is comparable to knowing P and Q, the two prime factors of N, mathematically speaking using continued fraction, The Wiener attack against the RSA cryptosystem with a small secret exponent is an application of this finding. Then, we show that regardless of the choice of N, there exists an attack based on continued fractions that recovers the secret exponent.
