A Probabilistic Data Encryption scheme (PDES)

Aldrin W. Wanambisi, Cleophas Maende, Geoffrey Muchiri Muketha, Shem Aywa


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.

Key words: Quadratic residuacity, pseudorandom number generator, one-way function

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email: JNSR@iiste.org

ISSN (Paper)2224-3186 ISSN (Online)2225-0921

Please add our address "contact@iiste.org" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright © www.iiste.org