Three Prime RSA Algorithm Using Randomly Generated Prime Sequence Cryptosystem
Keywords:
Asymmetric key Cryptography Sub-set Sum cryptography, RSA cryptosystem, Security.Abstract
Existing RSA cryptosystem is not in used due to the fact that it is very slow in process and also having the problem of Brute force and factorization attack. Hence these factors can degrade the performance of the RSA cryptosystem. Therefore a concept is needed which can overcome these entire factor. Hence we proposed algorithm we use the hybrid combination of the subset sum problem and modified RSA cryptosystem. In this work, we are going to enhance the security of the RSA algorithm. Here we are using three prime numbers in place of two and also adding super increasing sequence for the key generation process. If Attacker wants to break proposed systems then one has to factor the modulus into its primes as well as find the secret set A. If modified RSA, which is based on single module is broken in time x and subset sum algorithm is broken in time y then the time required to break this proposed algorithm is x*y. Therefore the security of our proposed system is increased as compared to RSA algorithm.
References
- Digital signature scheme with message recovery using knapsack-based ECC International journal of network security, Vol.12, No.1, jan 2011. R. Rajaram Ramasamy and M. Amutha prabakar.
- Knapsack based ECC Encrytion and Decryption. International journal of network security, Vol.12, No.1, jan 2011.R.Rajaram Ramasamy and M. Amutha prabakar.
- An Efficient Signature System Using Optimized RSA Algorithm IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008 Prof. MOUSTAFA ABD EL-AZIEM, Dr. MOHAMMAD ALI GOMAA.
- IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008, "An Efficient Signature System Using Optimized RSA Algorithm ".
- T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, July 1985.W.Diffie and M. Hellman. "New Directions in Cryptography ". IEEE transactions on Information Theory. IT-22(1978).472-492.
- R. C. Merkle and M. E. Hellman, "Hiding information and signatures in trapdoor knapsacks, "IEEE Trans. Inf. Theory, IT- 24(5), pp.525-530, 1978.
- Shamir, A. 1984. A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem; Information Theory, IEEE Transactions on , Volume: 30 Issue: 5 , Sep 1984 Page(s): 699 –704
- Diffie, W.; Hellman, M.1976. New directions in cryptography; Information Theory, IEEE Transactions on , Volume: 22 Issue: 6 , Nov 1976 Page(s): 644 –654
- M. E. Hellman and E.D. Karnin, 1983 "The Largest Super-Increasing Subset of a Random Set, "IEEE Trans. on Info. Theory, Vol. IT-29, January 1983, pp.
- R. Rajaram Ramasamy and M. Amutha Prabakar 2011. Digital Signature Scheme with Message Recovery Using Knapsack-based ECC, International Journal of Network Security, Vol.12, No.1, PP.7 - 12, Jan. 2011
- M. E. Hellman, "An Overview of Public Key Cryptography, "IEEE Communications Society Magazine, Vol. 16, Nov. 1978, pp.24-32 (Invited Paper).
- W. Diffie and M. E. Hellman, "Privacy and Authentication: An Introduction to Cryptography, "Proceedings of the IEEE, Vol. 67, March 1979.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.