The opening section of this book covers key concepts of cryptography, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. The second part addresses advanced topics, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. Examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. The second edition presents new material, including a complete description of the AES, an extended section on cryptographic hash functions, a new section on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.

Compact introduction on an undergraduate level to the foundations of public-key cryptography in the first part No special background in mathematics is presumed, an explanation of the necessary mathematics is given in two appendices The same examples are used throughout the book Complete proofs are given Includes supplementary material: sn.pub/extras

Autorentext

Prof. Dr. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures. Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.

Inhalt
Symmetric-Key Encryption.- Public-Key Cryptography.- Cryptographic Protocols.- Probabilistic Algorithms.- One-Way Functions and the Basic Assumptions.- Bit Security of One-Way Functions.- One-Way Functions and Pseudorandomness.- Provably Secure Encryption.- Provably Secure Digital Signatures.