Browsing by Author "Maende, Cleophas."

Now showing 1 - 4 of 4

Advances in composite integer factorization
(2013) Wanambisi, Aldrin W.; Aywa, Shem.; Maende, Cleophas.; Muketha, Geoffrey Muchiri.
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.
Advances in composite integer factorization
(Mathematical theory and modelling, 2013) Wanambisi, Aldrin.; Aywa, Shem.; Maende, Cleophas.; Muketha, Geoffrey Muchiri.
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.
Factorization of large composite integer
(International journal of mathematics and studies, 2013) Wanambisi, Aldrin.; Aywa, Shem.; Maende, Cleophas.; Muketha, Geofrey Muchiri.
This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n or test it for primality. One way of making these problems precise uses a multi-tape Turing machine (e.g. (1), although we require a version with an input tape). At the start of the calculation n is written in radix notation on one of the tapes, and the machine is to stop after writing out the factors in radix notation or after writing one of two symbols denoting ‘prime’ or ‘composite’. There are, of course, other definitions which could be used; but the differences between these are unimportant for our purpose.
A probabilistic data encryption scheme (PDES)
(2013) Wanambisi, Aldrin W.; Maende, Cleophas.; Muketha, Geoffrey.; Aywa, Shem.
A chaos-based cryptosystem has exhibited some unconventionally excellent properties. At the same time, it is of vital significance for its advancement to give a mathematically rigorous cryptanalysis. In this study, we analyze the security of an image encryption algorithm, whose main idea is to use the sum of image data for encryption. By applying known plaintext and chosen plaintext attacks, we show that all the secret keys can be revealed.