Advances in composite integer factorization

dc.contributor.authorWanambisi, Adrin W.
dc.contributor.authorAywa, Shem
dc.contributor.authorMaende, Cleophas
dc.contributor.authorMuketha, Geoffrey Muchiri
dc.date.accessioned2019-04-28T09:45:03Z
dc.date.available2019-04-28T09:45:03Z
dc.date.issued2013-01-01
dc.description.abstractIn 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.issn22250522
dc.identifier.urihttp://erepository.kibu.ac.ke/handle/123456789/731
dc.language.isoenen_US
dc.publisherInternational Knowledge Sharing Platiformen_US
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.subjectIntegeren_US
dc.subjectFactorizationen_US
dc.subjectPrime numberen_US
dc.subjectlogarithmen_US
dc.titleAdvances in composite integer factorizationen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
wanambisi_Advances in composite integer factorization.pdf
Size:
195.29 KB
Format:
Adobe Portable Document Format
Description:
Full text

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: