Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA
Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA
Kritsanapong Somsuk,Sumonta Kasemvilas
2014 · DOI: 10.1007/978-3-319-06538-0_32
International Conference on Computer and Information Technology · 6 Citations
TLDR
The experimental results show that P2MFF can factor the modulus faster than MFF and MFFV2 and can decrease the number of times in order to compute thesquare root of some integers whenever the authors can strongly confirm that square root of these integers is not an integer by using number theory.