A Classical Introduction To Cryptography Applications For Communications Security Author Serge Vaudenay Oct 2005 [RECOMMENDED]

What sets this book apart from “classical” texts of the 1990s is its insistence on provable security. Vaudenay introduces:

Vaudenay treats cryptography as a living discipline. He includes historical ciphers (Caesar, Vigenère, Enigma) not as curiosities, but as lessons. The failure of the Lorenz cipher (and Colossus’s success) is presented as a case study in key reuse —the same flaw that would later break WEP. This classical framing prevents history from repeating. What sets this book apart from “classical” texts

This section is a masterclass in applied number theory. RSA, Diffie-Hellman, and ElGamal are presented with equal emphasis on mathematical correctness (Euler’s theorem, discrete log problems) and operational pitfalls (padding oracles, small exponent attacks). Vaudenay famously includes a case study on the Chosen Ciphertext Attack (CCA) , which would become critically relevant with the later discovery of the POODLE and ROBOT attacks against TLS. The failure of the Lorenz cipher (and Colossus’s

“Consider a modified CBC mode where the IV is not random but is set to the last ciphertext block of the previous message. Show that this mode is insecure under a chosen plaintext attack if the attacker can observe two messages encrypted with the same key. Construct an explicit attack.” RSA, Diffie-Hellman, and ElGamal are presented with equal

Over the years, the book has been adopted in courses at MIT, Stanford, ETH Zurich, and many other institutions. Its companion website (now archived) provided lecture slides and corrected exercises. While a second edition has not been released (as of this writing), the first edition remains in print, a testament to its lasting value.

To appreciate Vaudenay’s contribution, one must understand the state of cryptography in the mid-2000s. The internet was maturing. E-commerce, online banking, and VoIP were becoming mainstream. The Advanced Encryption Standard (AES) had been finalized just a few years earlier (2001), and cryptographic protocols like SSL/TLS were undergoing rapid iteration.

The subtitle is not an afterthought. Each chapter concludes with a "Communications Security" section. For example, after discussing hash functions, Vaudenay immediately applies them to HMAC in IPsec. After RSA, he examines its use in S/MIME email encryption. This grounds the theory in protocols the reader likely uses daily.