FACTORIZATION OF LARGE COMPOSITE INTEGER
| dc.contributor.author | Wanambisi, Aldrin W. | |
| dc.date.accessioned | 2017-02-22T12:52:07Z | |
| dc.date.available | 2017-02-22T12:52:07Z | |
| dc.date.issued | 2013 | |
| dc.description.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. | en_US |
| dc.identifier.uri | https://repository.mut.ac.ke/handle/123456789/152 | |
| dc.identifier.uri | https://www.eajournals.org/wp-content/uploads/FACTORIZATION-OF-LARGE-COMPOSITE-INTEGER.pdf | |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Mathematics and Statistics Studies | en_US |
| dc.subject | Integer factorization, Composite integer, Algebraic approach, Primes, Algorithms, Prime differences | en_US |
| dc.title | FACTORIZATION OF LARGE COMPOSITE INTEGER | en_US |
| dc.type | Article | en_US |