Analysis of Attack on RSA through Formal Verification Methods
Sachin Upadhyay, Yashpal Singh · 2011
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.