Show simple item record

dc.contributor.authorWanambisi, Aldrin W.
dc.date.accessioned2017-02-22T12:52:07Z
dc.date.available2017-02-22T12:52:07Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/123456789/152
dc.identifier.urihttps://www.eajournals.org/wp-content/uploads/FACTORIZATION-OF-LARGE-COMPOSITE-INTEGER.pdf
dc.description.abstractIn 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.language.isoenen_US
dc.publisherInternational Journal of Mathematics and Statistics Studiesen_US
dc.subjectInteger factorization, Composite integer, Algebraic approach, Primes, Algorithms, Prime differencesen_US
dc.titleFACTORIZATION OF LARGE COMPOSITE INTEGERen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record