Factorization of Large Composite Integer


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.

Keywords: Algebraic Approach, Algorithms, Composite Integer, Integer Factorization, Prime Differences, Primes

Article Review Status: Published

Pages: 39-44 (Download PDF)

Creative Commons Licence
This work by European American Journals is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License