Synopses & Reviews
Focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs.
Synopsis
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. This book focuses on the basic mathematical tools needed for for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. The emphasis is on the clarification of fundamental concepts, and on demonstrating the feasibility of solving several central cryptographic problems. The book is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful.
Synopsis
The design of cryptographic systems must be based on firm foundations. This book focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. Suitable for use in a graduate course, the book's emphasis is on the clarification of fundamental concepts, and on demonstrating the feasibility of solving important cryptographic problems.
Synopsis
Cryptography concerns constructing computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations and this book focuses on the basic mathematical tools needed: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. The emphasis is to clarify fundamental concepts, and to demonstrate the feasibility of solving several central cryptographic problems. The book is suitable for graduate cryptography courses and as a reference for experts, and assumes basic familiarity with design and analysis of algorithms; knowledge of complexity theory and probability would also be useful.
About the Author
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.
Table of Contents
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.