Show simple item record

dc.contributor.authorWanambisi, A.W.
dc.contributor.authorAywa, S.
dc.contributor.authorMaende, C.
dc.contributor.authorMuketha, Geoffrey M.
dc.date.accessioned2017-02-28T06:04:52Z
dc.date.available2017-02-28T06:04:52Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/123456789/265
dc.identifier.urihttp://www.iiste.org/Journals/index.php/MTM/article/view/4591
dc.identifier.urihttps://www.slideshare.net/AlexanderDecker/advances-in-composite-integer-factorization
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.language.isoenen_US
dc.subjectlogarithmen_US
dc.titleAdvances in composite integer factorizationen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record