Foundations of Cryptography: Volume 1, Basic Tools
Seiten
2001
Cambridge University Press (Verlag)
978-0-521-79172-4 (ISBN)
Cambridge University Press (Verlag)
978-0-521-79172-4 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Focuses on the basic mathematical tools needed for cryptographic design: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs.
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 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. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing ad-hoc approaches. 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.
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 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. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing ad-hoc approaches. 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.
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.
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.
| Erscheint lt. Verlag | 6.8.2001 |
|---|---|
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 185 x 262 mm |
| Gewicht | 823 g |
| Themenwelt | Informatik ► Netzwerke ► Sicherheit / Firewall |
| Informatik ► Theorie / Studium ► Kryptologie | |
| ISBN-10 | 0-521-79172-3 / 0521791723 |
| ISBN-13 | 978-0-521-79172-4 / 9780521791724 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Das Lehrbuch für Konzepte, Prinzipien, Mechanismen, Architekturen und …
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
eine Cyberstaatsanwältin ermittelt
Buch | Hardcover (2024)
Murmann Publishers (Verlag)
CHF 34,95
