CRYPTANALYSIS OF RSA THROUGH FORMAL VERIFICATION TOOLS
Sachin Upadhyay, Yashpal Singh · 2012
In this paper we are basically 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). So our emphasis is how we can make our system secure(based on the breaking of keys), One solution can be by choosing a big prime numbers as p & q further the efficient use of RSA algorithm will help to make system secure.