دانلود رایگان مقاله انگلیسی طرح تولید کلید RSA پیشرفته و ایمن (ESRKGS) - الزویر 2015

abstract

Public-key cryptography can be claimed as the greatest and an excellent revolution in the field of cryptography. A public-key cryptosystem is used for both confidentiality and authentication. One such public-key cryptosystem is the RSA cryptosystem. In this paper, a modified and an enhanced scheme based on RSA public-key cryptosystem is developed. The proposed algorithm makes use of four large prime numbers which increases the complexity of the system as compared to traditional RSA algorithm which is based on only two large prime numbers. In the proposed Enhanced and Secured RSA Key Generation Scheme (ESRKGS), the public component n is the product of two large prime numbers but the values of Encryption (E) and Decryption (D) keys are based on the product of four large prime numbers (N) making the system highly secured. With the existing factorization techniques, it is possible only to find the primes p and q. The knowledge of n alone is not sufficient to find E and D as they are based on N. The time required for cryptanalysis of ESRKGS is higher than traditional RSA cryptosystem. Thus the system is highly secure and not easily breakable. A comparison is done between the traditional RSA scheme, a recent RSA modified scheme and our scheme to show that the proposed technique is efficient.

6. Conclusion

In this paper, an enhanced RSA key generation algorithm called ESRKGS is proposed. The proposed work uses four large prime numbers instead of two prime numbers thereby increasing the attacking time needed to find these primes. The computation of keys E, D depends on the value of N (not n), which is the product of 4 prime numbers and the computation of E is also not direct. As a result the key generation time of ESRKGS is higher than traditional RSA and another compared RSA. The higher key generation time in turn increases the time needed to break the system, thereby making the system strong. The encryption and decryption time of ESRKGS is higher than RSA but significantly less than the other modified RSA which used four primes. Thus there is not much overhead or burden on the system. The performance of the algorithm is measured in terms of the time taken for brute-force attack. From the experiments, it is proved that the proposed algorithm is highly secure and not easily breakable as compared to RSA and the compared modified RSA algorithm.