Advances in composite integer factorization
| dc.contributor.author | Wanambisi, A.W. | |
| dc.contributor.author | Aywa, S. | |
| dc.contributor.author | Maende, C. | |
| dc.contributor.author | Muketha, Geoffrey M. | |
| dc.date.accessioned | 2017-02-28T06:04:52Z | |
| dc.date.available | 2017-02-28T06:04:52Z | |
| dc.date.issued | 2013 | |
| 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.identifier.uri | https://repository.mut.ac.ke/handle/123456789/265 | |
| dc.identifier.uri | http://www.iiste.org/Journals/index.php/MTM/article/view/4591 | |
| dc.identifier.uri | https://www.slideshare.net/AlexanderDecker/advances-in-composite-integer-factorization | |
| dc.language.iso | en | en_US |
| dc.subject | logarithm | en_US |
| dc.title | Advances in composite integer factorization | en_US |
| dc.type | Article | en_US |