Integer Factorization: Solution via Algorithm for Constrained Discrete Logarithm Problem

This research demonstrated how to find integer factors of n using an algorithm for a constrained DLP that has O(3√n) complexity and, if the search is balanced, it has complexity O(n1/3log1/α n), where alpha>1.