| Title of Article |
An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to
Decrease Computation Time |
| Date of Acceptance |
23 January 2016 |
| Journal |
| Title of Journal |
International Journal of Network Security |
| Standard |
SCOPUS |
| Institute of Journal |
National Chung Hsing University |
| ISBN/ISSN |
1816-3548 |
| Volume |
1 |
| Issue |
19 |
| Month |
มกราคม |
| Year of Publication |
2017 |
| Page |
99-111 |
| Abstract |
Fermat's Factorization Algorithm (FFA) and the algo-rithms improved from FFA are the fast integer factoriza-tion algorithms when these algorithms are chosen to nd
two large prime factors of the balanced modulus. The
key is a process to nd two perfect squares such that
their di erence is equal to the modulus. However, it is
time-consuming to nd these two integers because there
is only one solution but many integers are chosen in this
experiment to nd the solution. In this paper, a new
improvement of FFA is proposed by leaving out some un-related integers, which do not a ect getting the correct
solution. Leaving out these integers results from analyz-ing the last m digits of the modulus where m is a pos-itive integer. The new faster and improved algorithm is
called Speci c Fermat's Factorization Algorithm Consid-ered from X (SFFA-X) where X is represented as the last
m digits of the modulus. The experimental results showed
that SFFA-X can factor the modulus faster than FFA and
many modi ed algorithms of FFA especially when at least 2 digits of X are chosen for the implementation. |
| Keyword |
Fermat's factorization algorithm, integer fac-torization, RSA |
| Author |
|
| Reviewing Status |
มีผู้ประเมินอิสระ |
| Status |
ตีพิมพ์แล้ว |
| Level of Publication |
นานาชาติ |
| citation |
false |
| Part of thesis |
true |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย