Fast Approach to Factorize Odd Integers: An algorithm Based Study

Wang, Xingbo and Zhong, Junjian (2021) Fast Approach to Factorize Odd Integers: An algorithm Based Study. In: Current Topics on Mathematics and Computer Science Vol. 10. B P International, pp. 80-98. ISBN 978-93-91882-19-8

Full text not available from this repository.

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 u +1 or 2 u-1 with u being an odd integer and being a positive integer and the other divisor p satisfies 1 < p 2 +1 or 2 +1 < p 2 +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.

Item Type: Book Section
Subjects: Science Global Plos > Mathematical Science
Depositing User: Unnamed user with email support@science.globalplos.com
Date Deposited: 19 Oct 2023 07:44
Last Modified: 19 Oct 2023 07:44
URI: http://ebooks.manu2sent.com/id/eprint/1830

Actions (login required)

View Item
View Item