Analysis of Encryption Algorithms (RSA, SRNN and 2 Key Pair) for Information Security

Abstract

To transmit confidential information like e-mails, banking transactions, credit card details etc. over the unsecured network like internet Security is essential. There are more chances to read the information that is being transferred through network of computers or internet by other people. Now a days most of the countries are affected Ransomware attack. To avoid this we need a secure way to protect our data. So to protect information, we need to encrypt/decrypt information by using cryptography algorithms. In cryptography the data which is to be transmitted from sender to receiver in the network must be encrypted using the encryption algorithm and receiver can view the original data by using decryption technique. Mostly used asymmetric key encryption algorithm is RSA, which uses two keys one for encryption and another for decryption. Long time for the encryption process is the disadvantage of RSA algorithm. To overcome this problem, this paper performs comparative analysis of three algorithms: RSA, short range natural number (SRNN) and two key pair algorithm considering parameters encryption / decryption time. The programs are implemented using JAVA library function. The class BigInteger is used to hold large prime numbers and keys so that it difficult for hacker to guess the data. The algorithms are executed successfully on different size of text files. Comparing the encryption time results using normal RSA algorithm, SRNN and two key pair algorithm, it was proved that SRNN algorithm takes less time for encryption.