Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA
verfasst von : Kritsanapong Somsuk, Sumonta Kasemvilas
Erschienen in: Recent Advances in Information and Communication Technology
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The aim of this research is to propose a new modified integer factorization algorithm, called Possible Prime Modified Fermat Factorization (P
2
MFF), for breaking RSA which the security is based upon integer factorization. P
2
MFF is improved from Modified Fermat Factorization (MFF) and Modified Fermat Factorization Version 2 (MFFV2). The key concept of this algorithm is to reduce iterations of computation. The value of larger number in P
2
MFF is increased more than one in each iteration of the computation, it is usually increased by only one in MFF and MFFV2. Moreover, this method can decrease the number of times in order to compute the square root of some integers whenever we can strongly confirm that square root of these integers is not an integer by using number theory. The experimental results show that P
2
MFF can factor the modulus faster than MFF and MFFV2.