Algebraic approach to composite integer factorization

dc.contributor.author	Wanambisi, Adrin W.
dc.contributor.author	Aywa, Shem
dc.contributor.author	Maende, cleophas
dc.contributor.author	Muketha, Geoffrey Muchiri
dc.date.accessioned	2019-04-30T05:36:48Z
dc.date.available	2019-04-30T05:36:48Z
dc.date.issued	2013-03-01
dc.identifier.uri	http://erepository.kibu.ac.ke/handle/123456789/780
dc.description.abstract	There various algorithms that can factor large integers but very few of these algorithms run in polynomial time. This fact makes them inefficient. The apparent difficulty of factoring large integers is the basis of some modern cryptographic algorithms. In this paper we propose an algebraic approach to factoring composite integer. This approach reduces the number of steps to a finite number of possible differences between two primes.	en_US
dc.language.iso	en	en_US
dc.publisher	European Centre for Research, Training and Development : IJMSS	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/	*
dc.subject	Composite integer	en_US
dc.subject	Primes	en_US
dc.subject	Algebraic decomposition	en_US
dc.subject	Algorithm	en_US
dc.title	Algebraic approach to composite integer factorization	en_US
dc.type	Article	en_US

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 3.0 United States