Empirical analysis of some cryptographic algorithms

Abstract

In this paper we have carried out some experimental analysis of two cryptographic algorithms RSA and DES and checked the strength of these algorithms against brute force cracking. The testing has been done on different file sizes ranging from 62 Bytes to 92.7 Kilobytes. From the experiments, it is found that the RSA (using random method of prime number generation) is more secure and robust than the DES algorithm but the RSA algorithm using Euclid method is most susceptible to hacking.