Algorithmic Cryptanalysis

Antoine Joux

June 15, 2009 by Chapman and Hall/CRC
Reference - 520 Pages - 22 B/W Illustrations
ISBN 9781420070026 - CAT# C7002
Series: Chapman & Hall/CRC Cryptography and Network Security Series

was $97.95


SAVE ~$9.80

Add to Cart
Add to Wish List
FREE Standard Shipping!


  • Introduces cryptography from a cryptanalytic perspective
  • Covers linear algebra, sieving, brute force, algorithms based on the birthday paradox, Hadamard–Fourier–Walsh transforms, lattice reduction, and Gröbner bases
  • Presents advanced applications, such as LFSR-based stream ciphers, lattice methods for cryptanalysis, elliptic curves, and index calculus methods
    • Includes exercises, with some hints and solutions offered on
    • Provides several C codes for download on


    Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.

    Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applications. The final part addresses more sophisticated cryptographic applications, including LFSR-based stream ciphers and index calculus methods.

    Accounting for the impact of current computer architectures, this book explores the algorithmic and implementation aspects of cryptanalysis methods. It can serve as a handbook of algorithmic methods for cryptographers as well as a textbook for undergraduate and graduate courses on cryptanalysis and cryptography.