Focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs.
Focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs.
Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an Incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity, and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Computational Complexity: A Conceptual Perspective, and the two-volume work Foundations of Cryptography.
Inhaltsangabe
List of figures Preface 1. Introduction 2. Computational difficulty 3. Pseudorandom generators 4. Zero-knowledge proof systems Appendix A: background in computational number theory Appendix B: brief outline of volume 2 Bibliography Index.
List of figures Preface 1. Introduction 2. Computational difficulty 3. Pseudorandom generators 4. Zero-knowledge proof systems Appendix A: background in computational number theory Appendix B: brief outline of volume 2 Bibliography Index.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
