FACTORIZATION OF LARGE COMPOSITE INTEGER
Abstract
In this paper we practically deal with the problem of factorizing large integers. The various
algorithms that have been proposed are not efficient that is they do not run in polynomial time. We use
the algebraic approach proposed by Wanambisi et al [1]. We define a large integer based on the number
of digits and seek to decompose these numbers based on place values.
URI
http://hdl.handle.net/123456789/152https://www.eajournals.org/wp-content/uploads/FACTORIZATION-OF-LARGE-COMPOSITE-INTEGER.pdf
Collections
- Journal Articles (PAS) [267]