Advances in composite integer factorization
dc.contributor.author | Wanambisi, Aldrin W. | |
dc.contributor.author | Aywa, Shem. | |
dc.contributor.author | Maende, Cleophas. | |
dc.contributor.author | Muketha, Geoffrey Muchiri. | |
dc.date.accessioned | 2019-05-06T14:33:19Z | |
dc.date.available | 2019-05-06T14:33:19Z | |
dc.date.issued | 2013 | |
dc.identifier.issn | 2224-5804 | |
dc.identifier.uri | http://erepository.kibu.ac.ke/handle/123456789/859 | |
dc.description.abstract | In this research we propose a new method of integer factorization. Prime numbers are the building blocks of arithmetic. At the moment there are no efficient methods (algorithms) known that will determine whether a given integer is prime or and its prime factors [1]. This fact is the basis behind many of the cryptosystems currently in use. | en_US |
dc.language.iso | en | 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 | Integer factorization | en_US |
dc.subject | Prime number | en_US |
dc.subject | Logarithm. | en_US |
dc.title | Advances in composite integer factorization | en_US |
dc.type | Article | en_US |