Fast Approach to Factorize Odd Integers: An algorithm Based Study

Abstract

The paper proves that an odd composite integer N can be factorized in O ((log₂N)⁴) bit operations if N = pq, the divisor q is of the form 2^\(\alpha\)u +1 or 2^\(\alpha\)u-1 with u being an odd integer and \(\alpha\) being a positive integer and the other divisor p satisfies 1 < p \(\leq\) 2^\(\alpha\) +1 or 2^\(\alpha\) +1 < p \(\leq\) 2^\(\alpha\)+1-1. Theorems and corollaries are proved with detail mathematical reasoning. Algorithm to factorize the odd composite integers is designed and tested in Maple. The results in the paper demonstrate that fast factorization of odd integers is possible with the help of valuated binary tree.