Helmut Knebl Book order

Probabilistic methods are emphasized as essential for developing simple and efficient algorithms in this textbook. Each chapter features at least one problem solved with a randomized algorithm, showcasing practical applications. The discussion of data structures is tailored to support algorithm implementation, ensuring a focused approach. The selected algorithms are chosen for their broad applicability, making this resource valuable for students in computer science.

This book covers key concepts of cryptography, from encryption and digital signatures to cryptographic protocols, presenting techniques and protocols for key exchange, user ID, electronic elections and digital cash. Advanced topics include bit security of one-way functions and computationally perfect pseudorandom bit generators. Assuming no special background in mathematics, it includes chapter-ending exercises and the necessary algebra, number theory and probability theory in the appendix. This edition offers new material including a complete description of the AES, a section on cryptographic hash functions, new material on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.