| dc.contributor.author | Wanambisi, A. W. | |
| dc.contributor.author | Maende, C. | |
| dc.contributor.author | Muketha, Geoffrey M. | |
| dc.contributor.author | Aywa, S. | |
| dc.date.accessioned | 2017-02-28T05:54:44Z | |
| dc.date.available | 2017-02-28T05:54:44Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/260 | |
| dc.identifier.uri | http://www.iiste.org/Journals/index.php/JNSR/article/viewFile/4187/4239 | |
| dc.identifier.uri | https://www.semanticscholar.org/paper/A-Probabilistic-Data-Encryption-scheme-(PDES)-Wanambisi-Maende/d14c6337ec7e2990d941486426a58be90c458266 | |
| dc.identifier.uri | http://erepository.kibu.ac.ke/handle/123456789/905 | |
| dc.description.abstract | 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 | en_US |
| dc.language.iso | en | en_US |
| dc.subject | Quadratic residuacity | en_US |
| dc.title | A Probabilistic Data Encryption scheme (PDES) | en_US |
| dc.type | Article | en_US |
