Fast cryptanalysis of RSA encrypted data using a combination of mathematical and brute force attack in distributed computing environment

The RSA is a very popular asymmetric encryption algorithm used for data security. The algorithms security lies in difficulty of factoring large numbers since crypt-analysing of RSA takes a huge amount of time interms of years even for small key values. Our work attempts to use multiple computer systems in distributed computing environment to increase processing speed and provide multitasking. The algorithm presented here can cryptanalyse RSA algorithm for any length of key. The use of Mobile agents to distribute the workload proved to be one of the best ways of Distributed Computing. Our analysis shows that the use of a sufficient number of systems reduces the cryptanalysis time considerably.