Now showing items 1-3 of 3
A Probabilistic Data Encryption scheme (PDES)
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 ...
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
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 ...
Advances in composite integer factorization
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 ...