Novel Approach to Factorize the RSA Public Key Encryption
Main Article Content
Abstract
The security of public key encryption such as RSA algorithm relied on the integer factoring problem of N. The security of RSA algorithm based on positive integer N, which is the product of two large prime numbers, the factorization of N is very complex. In this paper a factorization method is proposed, which is used to obtain the factor of positive integer N. Prime numbers play a very important role in the complexity and security of the public key crypto system. RSA Algorithm is one type of public key algorithm and its security depends on the complexity of factoring value of N. Any encryption algorithm depends on the length of the key and the computational effort required breaking the key. This paper introduces an efficient algorithm to attack on the RSA algorithm. Obtaining the private key of the RSA algorithm is the target of the suggested algorithm by factoring the modulus based on the public key (N, e) of the RSA algorithm. The suggested algorithm is very fast due to its treatments for the factorizing problem. It will limit the search for the two prime no’s p & q values. The suggested algorithm is more efficient than most existed algorithms of attack since it will interrupt the search process and takes less running time.
Â
Keywords-Public Key Cryptography, RSA Algorithm, Factorization Problem, Attacks, Public Key Cryptography.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.