Reduction in Hacking Time by Using Five Prime Numbers in RSA Algorithm

Abstract

newlineABSTRACT newlineInternet security has witnessed an explosive and exciting growth in the past decades. In newlinetoday s digital world, one of the principal challenges of resource sharing on data newlinecommunication network is to keep information safe from various competitors. Without newlinesolving these challenges, secure systems will not reach the expected potential. The newlinesignificance of security devices that protect the numerous transactions, which take place in newlinetoday s distributed virtual environment, cannot be underestimated. Privacy of user s personal newlineinformation is the primary requirement in order to keeptheir information safe from hackers newlinewithout any tempering thus secure and timely transmission of data is always an important newlineparameter for that various encryption and mechanisms are used to achieve confidentiality, newlineauthentication, and integrity of data and reduce the overheads of the system. Keeping in view newlinethe importance of dynamic keys for secure data transmission, the researchis focused on the use newlineof dynamic keys for data security. In this work various encryption algorithms have been newlinestudied. Literature Survey has been carried out by incorporating key papers related to data newlineencryption. From the literature survey; gaps and observation have also been drawn. Thus an newlinealgorithm has been proposed so that length of key becomes long for attackers to break the newlinekey. The proposed algorithm instead of using two prime numbers to produce public and newlineprivate key, here we have used five prime numbers which will produce variable N with newlineenormous size. The proposed algorithm then compared with RSA and Hill Cipher algorithm. newlineRSA is critically analyzedand key management has also been optimized. Simulation results newlinehave been achieved using MATLAB 12a. The results prove that the proposed algorithm newlineincreases the security of the system and is optimized compared to RSA and Hill Cipher newlinealgorithm as the proposed algorithm reduces the computation time, therefore hacking time is newlinereduced which indicate that the time available for the hacker has been reduced. Finally, newlineconclusion and future work has also been stated at the end of thesis.