Call for Paper - Upcoming Issues

An Optimized Algorithm for the Prime Factorization Problem

International Journal of Computer Science and Engineering
© 2025 by SSRG - IJCSE Journal
Volume 12 Issue 11
Year of Publication : 2025
Authors : Ayman Timjicht
10.14445/23488387/IJCSE-V12I11P103

pdf
How to Cite?

Ayman Timjicht, "An Optimized Algorithm for the Prime Factorization Problem," SSRG International Journal of Computer Science and Engineering , vol. 12,  no. 11, pp. 15-17, 2025. Crossref, https://doi.org/10.14445/23488387/IJCSE-V12I11P103

Abstract:

This article introduces a new scientific discovery in the field of computational number theory: an enhanced integer factorization method that unifies an optimized form of a prime generator algorithm with an advanced trial division framework. This integration produces a factorization technique that is both faster and more structurally elegant than conventional approaches. The discovery lies in demonstrating how a modern prime generator can be adapted and expanded to drive the factorization process with greater precision, reducing unnecessary computations and improving overall performance. The paper details the conceptual foundations of the method, outlines its computational advantages, and explains the process choices that make the algorithm both practical and theoretically elegant. The article describes the transformation of a simple prime generator algorithm into a solution for an NP problem, achieving optimized time and space efficiency.

Keywords:

Algorithmic Complexity, Computational Number Theory, Prime Factorization, Prime Generation, Trial Division.

References:

[1] Kadir Duman et al., “Enhancing Mechanical Properties of Polyurea through Cellulose Nano Crystals (CNF) Reinforcement,” Scientific Bulletin of the University Politehnica of Bucharest, vol. 87, no. 1, pp. 1-16, 2025.
[Publisher Link]
[2] Mircea Ghidarcea, and Decebal Popescu, “Prime Number Sieving—A Systematic Review with Performance Analysis,” Mathematics, vol. 12, no. 4, pp. 1-20, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Muhammad Khoiruddin Harahap, and Nurul Khairina, “The Comparison of Methods for Generating Prime Numbers between The Sieve of Eratosthenes, Atkins, and Sundaram,” SinkrOn, vol. 3, no. 2, pp. 293-298, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Richard Crandall, and Carl B. Pomerance, Prime Numbers: A Computational Perspective, Springer, 2005.
[Google Scholar] [Publisher Link]
[5] John M. Pollard, “A Monte Carlo Method for Factorization,” BIT Numerical Mathematics, vol. 15, no. 3, pp. 331-334, 1975.
[Google Scholar] [Publisher Link]