An Analysis of the Attack on RSA Cryptosystem through Formal Methods
Sachin Upadhyay1, Yashpal Singh2, Amit Kumar Jain3
1Sachin Upadhyay, Department of Mathematical Sciences and Computer Applications, Bundelkhand University, Department of Computer Science & Engineering, Bundelkhand Institute of Engineering & Technology Jhansi, India.
2Yashpal Singh, Department of Computer Science & Engineering & Technology Jhansi, India.
|3Amit Kumar Jain, Department of Mathematical Sciences and Computer Applications, Bundelkhand University, Department of Computer Science & Engineering, Bundelkhand Institute of Engineering & Technology Jhansi, India.
Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 429-432 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0638042212/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Communication is the basic process of exchanging information. The effectiveness of computer communication is mainly based on the security aspects whether it is through internet or any communication channel. The aim of this paper is based on analyzing the results given by Wiener’s, who says that if the private exponent d used in RSA cryptosystem is less than n^.292 than the system is insecure. We will focus on the result given by Weiner’s and try to increase the range of private exponent d up to n^0.5. As n is the product of p & q (which are the relative prime numbers). This paper also aims at considering the different factors that affects the performance of encryption algorithms so as to make our information more secure over the network.
Keywords: Conjunctive Normal Form (CNF), Cryptanalysis, RSA Algorithm, , SAT Solver tool.