Abstract
The paper proves that an odd composite integer N can be factorized in O ((log2N)4) 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.