|
|
Publication
|
| Title of Article |
Improving fermat factorization algorithm by dividing modulus into three forms |
| Date of Acceptance |
5 June 2016 |
| Journal |
| Title of Journal |
KKU Engineering Journal |
| Standard |
TCI |
| Institute of Journal |
Faculty of Engineering, Khon Kaen University (KKU) |
| ISBN/ISSN |
0125-8273 |
| Volume |
2016 |
| Issue |
43 |
| Month |
|
| Year of Publication |
2016 |
| Page |
350-353 |
| Abstract |
Integer Factorization (IF) becomes an important issue since RSA which is the public key cryptosystem was occurred, because
IF is one ofthe techniques for breaking RSA. Fermat’s Factorization Algorithm (FFA) is one of integer factorization algorithms
that can factor all values of modulus. In general, FFA can factor the modulus very fast in case that both of prime factors are
very close. Although many factorization algorithms improved from FFA were proposed, it is still time – consuming to find the
prime factors. The aim of this paper is to present a new improvement of FFA in order to reduce the computation time to factor
the modulus by removing some iterations of the computation. In fact, the key of the proposed algorithm is the combination
within the three techniques to check the forms of the modulus before making decision to leave some integers out from the
computation. In addition, the proposed algorithm is called Multi Forms of Modulus for Fermat Factorization Algorithm (MnFFA).
The experimental results show that Mn-FFA can reduce the iterations of computation for all values of the modulus when
it is compared with FFA and the other improved algorithms. |
| Keyword |
Fermat’s Factorization Algorithm (FFA), Modulus, Prime number, Multi Forms of Modulus for Fermat Factorization Algorithm (Mn-FFA) |
| Author |
|
| Reviewing Status |
มีผู้ประเมินอิสระ |
| Status |
ตีพิมพ์แล้ว |
| Level of Publication |
ชาติ |
| citation |
false |
| Part of thesis |
true |
| Attach file |
|
| Citation |
0
|
|
|
|
|
|
|
|
|
Journal Publication
ไทย