ALGORITHMS FOR SOLVING THE FACTORIZATION PROBLEM

Authors

  • Abdurakhimov Bakhtiyor Fayziyevich Mirzo Ulugbek National University of Uzbekistan, e-mail: bakhtiyor@mail.ru
  • Akhadova O'giloy Chorshanbi qizi Mirzo Ulugbek National University of Uzbekistan, e-mail: oaxadova95@bk.ru

Abstract

In this article, Fermat's factorization method and Pollard's Rho method are proposed to solve the factorization problem. Experiments showed that Pollard's Rho method is more efficient in solving the factorization problem compared to Fermat's factorization method, particularly in terms of time and memory complexity. The results of the experiments are planned to be discussed in detail in the next articles.

References

1. Ishmukhametov Sh. T. Methods of Factorization of Natural Numbers: A Textbook — Kazan: Kazan University, 2011. — 190 p.

2. Schneier B. Applied Cryptography. Protocols, Algorithms, and Source Code in C. — Moscow: Triumph, 2002. — 816 p. — ISBN 5-89392-055-4.

3. Bressoud, D. M. Factorization and Primality Testing. — N. Y.: Springer-Verlag, 1989. — 260 p. — ISBN 0-387-97040-1.

Downloads

Published

2025-12-13

How to Cite

Abdurakhimov Bakhtiyor Fayziyevich, & Akhadova O'giloy Chorshanbi qizi. (2025). ALGORITHMS FOR SOLVING THE FACTORIZATION PROBLEM. Prospects for Innovative Technologies in Science and Education, 2(12), 58–61. Retrieved from https://incop.org/index.php/pro/article/view/2673

Issue

Vol. 2 No. 12 (2025): Prospects for innovative technologies in science and education

Section

Articles