A probabilistic data encryption scheme

Simple item page
dc.contributor.authorWanambisi, Adrin W.
dc.contributor.authorMaende, cleophas
dc.contributor.authorMuketha, Geoffrey Muchiri
dc.contributor.authorAywa, Shem
dc.date.accessioned2019-05-05T08:08:36Z
dc.date.available2019-05-05T08:08:36Z
dc.date.issued2013-01-01
dc.description.abstractIn 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 unknownen_US
dc.identifier.issn22243186
dc.identifier.issn(Online)22250921
dc.identifier.urihttps://www.iiste.org/Journals/index.php/JNSR/article/view/4187
dc.identifier.urihttp://erepository.kibu.ac.ke/handle/123456789/825
dc.language.isoenen_US
dc.publisherinternational journal sharing platiform ; Journal of Natural Sciences Researchen_US
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.subjectQuadratic residuacityen_US
dc.subjectpseudorandom number generatoren_US
dc.subjectone-way functionen_US
dc.titleA probabilistic data encryption schemeen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Wanambisi_a probabilistic data encryption scheme.pdf
Size:
413.26 KB
Format:
Adobe Portable Document Format
Description:
Full text
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Mathematics