doi: 10.17706/jsw.15.3.86-97
Algorithm Available for Factoring Big Fermat Numbers
2State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China.
3Guangdong Engineering Center of Information Security for Intelligent Manufacturing System, China.
Abstract—The paper proves that an odd composite integer N can be factorized in at most O( 0.125u (log2N)2) searching steps if N has a divisor of the form 2au +1 or 2au-1 with a >1 being a positive integer and u>1 being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested with certain Fermat numbers. The results in the paper might be helpful to factorize certain big Fermat numbers.
Index Terms—Algorithm, integer factorization, fermat number, cryptography.
Cite: Xingbo Wang, "Algorithm Available for Factoring Big Fermat Numbers," Journal of Software vol. 15, no. 3, pp. 86-97, 2020.
Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]