An effective Method for Attack RSA Strategy
Journal: International Journal of Advanced Networking and Applications (Vol.3, No. 05)Publication Date: 2012-03-02
Authors : Vibhor Mehrotra; Prakash Singh Rana;
Page : 1362-1366
Keywords : Public key cryptography; RSA scheme; factoring problem; RSA attack scheme;
Abstract
The protection on many public key encoding schemes depended on the intractability of detecting the integer factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring modulus compared with the other type of attack the RSA scheme. So the need for more methods of attacks other than RSA factoring modulus to find an effective and quicker algorithm to solve this problem is still crucial. This paper introduces a new algorithmic program which approaches the RSA scheme. The suggested algorithm aims to find the private key of the RSA scheme and then factoring the modulus based on the public key of the RSA scheme. The new idea exacted to be more efficient than the already existed algorithms particularly when the public key is small, since most of public key encryption schemes select a small public encryption key e in order to improve the efficiency of encryption. Also, the suggested algorithmic program is more effective since it is faster and takes less running time.
Other Latest Articles
- Counter Measures to Combat Misuses of MAC Address Spoofing Techniques
- Comparative Analysis of Routing Attacks in Ad Hoc Network
- A Survey on Security Issues in Ad Hoc Routing Protocols and their Mitigation Techniques
- Elliptic Curve Point Multiplication Using MBNR and Point Halving
- Optimal Routing In Ad-Hoc Network Using Genetic Algorithm
Last modified: 2015-12-03 20:19:29