The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Metadata Harvesting (OAI2)
  • Digital Archiving Policy

IJACSA

  • About the Journal
  • Call for Papers
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving
  • Editorial Board

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors

Computing Conference 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future of Information and Communication Conference (FICC) 2021

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Subscribe

Article Details

Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

Performance Analysis of Fermat Factorization Algorithms

Author 1: Hazem M. Bahig
Author 2: Mohammed A. Mahdi
Author 3: Khaled A. Alutaibi
Author 4: Amer AlGhadhban
Author 5: Hatem M. Bahig

Download PDF

Digital Object Identifier (DOI) : 10.14569/IJACSA.2020.0111242

Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 11 Issue 12, 2020.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: The Rivest-Shamir-Adleman (RSA) cryptosystem is one of the strong encryption approaches currently being used for secure data transmission over an insecure channel. The difficulty encountered in breaking RSA derives from the difficulty in finding a polynomial time for integer factorization. In integer factorization for RSA, given an odd composite number n, the goal is to find two prime numbers p and q such that n = p q. In this paper, we study several integer factorization algorithms that are based on Fermat’s strategy, and do the following: First, we classify these algorithms into three groups: Fermat, Fermat with sieving, and Fermat without perfect square. Second, we conduct extensive experimental studies on nine different integer factorization algorithms and measure the performance of each algorithm based on two parameters: the number of bits for the odd composite number n, and the number of bits for the difference between two prime factors, p and q. The results obtained by the algorithms when applied to five different data sets for each factor reveal that the algorithm that showed the best performance is the algorithms based on (1) the sieving of odd and even numbers strategy, and (2) Euler’s theorem with percentage of improvement of 44% and 36%, respectively compared to the original Fermat factorization algorithm. Finally, the future directions of research and development are presented.

Keywords: Integer factorization; Fermat’s algorithm; RSA; factorization with sieving; perfect square

Hazem M. Bahig, Mohammed A. Mahdi, Khaled A. Alutaibi, Amer AlGhadhban and Hatem M. Bahig, “Performance Analysis of Fermat Factorization Algorithms” International Journal of Advanced Computer Science and Applications(IJACSA), 11(12), 2020. http://dx.doi.org/10.14569/IJACSA.2020.0111242

@article{Bahig2020,
title = {Performance Analysis of Fermat Factorization Algorithms},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2020.0111242},
url = {http://dx.doi.org/10.14569/IJACSA.2020.0111242},
year = {2020},
publisher = {The Science and Information Organization},
volume = {11},
number = {12},
author = {Hazem M. Bahig and Mohammed A. Mahdi and Khaled A. Alutaibi and Amer AlGhadhban and Hatem M. Bahig}
}


IJACSA

Upcoming Conferences

Future of Information and Communication Conference (FICC) 2021

29-30 April 2021

  • Virtual

Computing Conference 2021

15-16 July 2021

  • London, United Kingdom

IntelliSys 2021

2-3 September 2021

  • Amsterdam, The Netherlands

Future Technologies Conference (FTC) 2021

28-39 October 2021

  • Vancouver, Canada
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Your Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • FAQ's
  • Terms and Conditions
  • Privacy Policy

© 2018 The Science and Information (SAI) Organization Limited. Registered in England and Wales. Company Number 8933205. All rights reserved. thesai.org