Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. Rather than describing ad-hoc approaches, this book emphasizes the clarification of fundamental concepts and the demonstration of the feasibility of solving cryptographic problems. It is suitable for use in a graduate course on cryptography and as a reference book for experts.Read more
- Systematic and rigorous approach that is focused on concepts
- Each chapter has exercises and guidelines for solution
Reviews & endorsements
"[Foundations of Cryptography: Basic Tools] presents complexity research which gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs...if a reader wants to learn about foundational work, Goldreich's books are the place to go."
Bulletin of the American Mathematical SocietySee more reviews
"Foundations of Cryptography contains what is currently the best published treatment of the formal aspects of modern cryptography and serves as "required reading" for anyone interested in the field... Throughout, definitions are complete and detailed; proofs are rigorous and given in full... Th book remains a "must-read' for all graduate students and researchers interested in this area, and is well-suited for an advanced course. Kudos to the author for publishing the first book which truly covers modern cryptography, and for doing an excellent job of it!"
Jonathan Katz, University of Maryland for SIGACT News
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: January 2007
- format: Paperback
- isbn: 9780521035361
- length: 396 pages
- dimensions: 254 x 178 x 21 mm
- weight: 0.69kg
- availability: Available
Table of Contents
List of figures
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
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×