Title :
Analysis of Attack on RSA through Formal Verification Methods
Author :
Upadhyay, Sachin ; Singh, Yaspal
Author_Institution :
Dept. of Math. Sci. & Comput. Applic., Bundelkhand Univ., Jhansi, India
Abstract :
By considering the old results if the private exponent d used in RSA cryptosystem is less than n^0.292 than the system is insecure. So the problem is that we need to consider a very big prime numbers in order to make our system secure. Our approach will help to increase the range of private exponent d up to n^0.5. This will help the individual to have bigger ranges regarding the prime numbers, so that the system remains secure to a greater extent.
Keywords :
formal verification; public key cryptography; RSA cryptosystem; attack analysis; formal verification methods; prime numbers; Computer science; Encryption; Public key cryptography; Timing; Cryptanalysis; Cryptography; Decryption; Encryption; RSA Algorithm; SAT Solver tool;
Conference_Titel :
Computational Intelligence and Communication Networks (CICN), 2011 International Conference on
Conference_Location :
Gwalior
Print_ISBN :
978-1-4577-2033-8
DOI :
10.1109/CICN.2011.33
