Probabilistic Encryption - Wanambisi, Aldrin
23,99 €
inkl. MwSt.

Versandfertig in über 4 Wochen
  • Broschiertes Buch

In this book we present a practicable probabilistic encryption scheme that is polynomially secure and is efficient. From the theoretical construction 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 permutation under the possible assumption that it is infeasible to factor composite integers, and that the least significant bit is hard-core for this permutation. Furthermore, we discuss the implementation of Probabilistic encryption.

Andere Kunden interessierten sich auch für
Produktbeschreibung
In this book we present a practicable probabilistic encryption scheme that is polynomially secure and is efficient. From the theoretical construction 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 permutation under the possible assumption that it is infeasible to factor composite integers, and that the least significant bit is hard-core for this permutation. Furthermore, we discuss the implementation of Probabilistic encryption.
Autorenporträt
Aldrin Wanambisi holds a Masters Degree in Pure Mathematics from Masinde Muliro University of Science and Technology. He is currently a PhD student at the same University. Aldrin is a lecturer and co-ordinator, School of Business at Mt. Kenya University. He is also a part-time lecturer at Masinde Muliro University and Kibabii University.