Computational analysis of Rsa based attacks

The RSA Algorithm has an indisputable importance in cryptology. RSA's security depends on the difficulty of factoring big composite number. This number is the multiplication of two or more prime numbers and its factorization is nearly infeasible. Since the existing RSA Algorithm needs long key sizes, requires big memory spaces and also has the deficiency depending on a feasible but long factorization principle, it seems necessary to make some changes or taking some necessary precautions during the implementation of RSA in order to provide maximum security level. In this thesis, RSA algorithm will be examined and evaluated in detail. Moreover, some security precautions, that support RSA against some applied cryptanalysis methods, will be indicated.