Browsing by Author "Wanambisi, Adrin W."

Now showing 1 - 3 of 3

Advances in composite integer factorization
(International Knowledge Sharing Platiform, 2013-01-01) Wanambisi, Adrin 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.
Algebraic approach to composite integer factorization
(European Centre for Research, Training and Development : IJMSS, 2013-03-01) Wanambisi, Adrin W.; Aywa, Shem; Maende, cleophas; Muketha, Geoffrey Muchiri
There various algorithms that can factor large integers but very few of these algorithms run in polynomial time. This fact makes them inefficient. The apparent difficulty of factoring large integers is the basis of some modern cryptographic algorithms. In this paper we propose an algebraic approach to factoring composite integer. This approach reduces the number of steps to a finite number of possible differences between two primes.
A probabilistic data encryption scheme
(international journal sharing platiform ; Journal of Natural Sciences Research, 2013-01-01) Wanambisi, Adrin W.; Maende, cleophas; Muketha, Geoffrey Muchiri; Aywa, Shem
In this paper the author presents a probabilistic encryption scheme that is polynomially secure and has the efficiency of deterministic schemes. From the theoretical construction of Brands and Gill (1996), it is clear that the proof of Pseudo randomness of the quadratic residue generator is complete if it can be shown that there exists a one-way function under the possible assumption that it is infeasible to solve the quadratic residuacity problem provided the factorization of the composite integer is unknown