Ctrl+K

Appendix: Annotated Bibliography

Appendix: Annotated Bibliography#

This appendix provides a comprehensive, annotated bibliography for Elements of Cryptanalysis, organised by part. Each entry includes a brief annotation describing its relevance to the course material.

Part 1: Foundations#

  • Al-Kindi (c. 850). Risalah fi Istikhraj al-Mu’amma (A Manuscript on Deciphering Cryptographic Messages). — The earliest known treatise on cryptanalysis. Introduces frequency analysis as a systematic method for breaking monoalphabetic substitution ciphers.

  • Kahn, D. (1996). The Codebreakers: The Comprehensive History of Secret Communication from Ancient Times to the Internet. Revised edition. Scribner. — The definitive single-volume history of cryptography and cryptanalysis. Essential background reading for the entire course.

  • Singh, S. (1999). The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Anchor Books. — An accessible popular history that covers the full sweep of cryptographic history with excellent narrative exposition.

Part 2: Substitution Ciphers#

  • Alberti, L.B. (1467). De Componendis Cifris. — The first European treatise on cryptography, introducing the polyalphabetic cipher disk.

  • Friedman, W.F. (1920). “The Index of Coincidence and Its Applications in Cryptanalysis.” Riverbank Publication No. 22. — Introduces the Index of Coincidence (IC), a foundational statistical tool for distinguishing monoalphabetic from polyalphabetic ciphers and estimating key length.

  • Bauer, F.L. (2007). Decrypted Secrets: Methods and Maxims of Cryptology. 4th edition. Springer. — A rigorous treatment of classical cryptanalysis with detailed mathematical exposition of substitution cipher attacks.

Part 3: Polyalphabetic Systems#

  • Kasiski, F.W. (1863). Die Geheimschriften und die Dechiffrir-Kunst. — Publishes the first general method for breaking the Vigenere cipher by identifying repeated trigrams to determine key length.

  • Vigenere, B. de (1586). Traicte des Chiffres. — Describes the autokey cipher and the tableau that bears his name (though the basic concept was Alberti’s).

  • Kullback, S. (1976). Statistical Methods in Cryptanalysis. Aegean Park Press. — Declassified NSA training manual providing rigorous statistical foundations for attacking polyalphabetic ciphers.

Part 4: Transposition Ciphers#

  • Gaines, H.F. (1939). Cryptanalysis: A Study of Ciphers and Their Solution. Dover. — Classic practical manual covering both substitution and transposition cipher analysis with numerous worked examples.

  • Toemeh, R. and Arumugam, S. (2008). “Breaking transposition cipher with genetic algorithms.” Elektrotehniski Vestnik, 75(3), 157–162. — Demonstrates modern computational approaches to transposition cipher cryptanalysis using evolutionary algorithms.

Part 5: Rotor Machines#

  • Rejewski, M. (1981). “How Polish Mathematicians Deciphered the Enigma.” Annals of the History of Computing, 3(3), 213–234. — Rejewski’s own account of the group-theoretic methods used to break Enigma, written decades after the war.

  • Turing, A.M. (c. 1940). “Prof’s Book” (Treatise on the Enigma). Unpublished manuscript, Bletchley Park. Declassified 2004. — Turing’s internal manual on Enigma cryptanalysis, including the theory of Banburismus and the Bombe.

  • Copeland, B.J. (ed.) (2006). Colossus: The Secrets of Bletchley Park’s Codebreaking Computers. Oxford University Press. — Comprehensive account of the Colossus machines and the breaking of the Lorenz cipher.

  • Budiansky, S. (2000). Battle of Wits: The Complete Story of Codebreaking in World War II. Free Press. — Thorough historical account integrating the British, American, and Polish contributions to wartime cryptanalysis.

Part 6: Shannon and Information Theory#

  • Shannon, C.E. (1949). “Communication Theory of Secrecy Systems.” Bell System Technical Journal, 28(4), 656–715. — The foundational paper of information-theoretic cryptography. Defines perfect secrecy, proves the one-time pad is optimal, and introduces unicity distance.

  • Shannon, C.E. (1948). “A Mathematical Theory of Communication.” Bell System Technical Journal, 27(3), 379–423. — The companion paper establishing information theory. Essential for understanding entropy, redundancy, and the information-theoretic limits that constrain both cryptography and cryptanalysis.

  • Cover, T.M. and Thomas, J.A. (2006). Elements of Information Theory. 2nd edition. Wiley. — The standard textbook on information theory, providing the mathematical framework underlying Shannon’s cryptographic results.

Part 7: Block Ciphers#

  • Biham, E. and Shamir, A. (1991). “Differential Cryptanalysis of DES-like Cryptosystems.” Journal of Cryptology, 4(1), 3–72. — Introduces differential cryptanalysis, one of the two most important general attacks on block ciphers.

  • Matsui, M. (1993). “Linear Cryptanalysis Method for DES Cipher.” In Advances in Cryptology — EUROCRYPT ‘93, LNCS 765, 386–397. Springer. — Introduces linear cryptanalysis and demonstrates its application to DES.

  • Daemen, J. and Rijmen, V. (2002). The Design of Rijndael: AES — The Advanced Encryption Standard. Springer. — The definitive reference on AES by its designers, explaining the design rationale and resistance to known attacks.

  • Knudsen, L.R. and Robshaw, M. (2011). The Block Cipher Companion. Springer. — Comprehensive survey of block cipher design and analysis techniques.

Part 8: Stream Ciphers#

  • Siegenthaler, T. (1985). “Decrypting a Class of Stream Ciphers Using Ciphertext Only.” IEEE Transactions on Computers, C-34(1), 81–85. — Introduces correlation attacks on LFSR-based stream ciphers.

  • Meier, W. and Staffelbach, O. (1988). “Fast Correlation Attacks on Stream Ciphers.” In Advances in Cryptology — EUROCRYPT ‘88, LNCS 330, 301–314. Springer. — Extends correlation attacks to practical efficiency.

  • Courtois, N. and Meier, W. (2003). “Algebraic Attacks on Stream Ciphers with Linear Feedback.” In Advances in Cryptology — EUROCRYPT 2003, LNCS 2656, 345–359. Springer. — Introduces algebraic attacks that exploit low-degree polynomial relations in combining functions.

  • Bernstein, D.J. (2008). “The Salsa20 Family of Stream Ciphers.” In New Stream Cipher Designs, LNCS 4986, 84–97. Springer. — Design rationale for the Salsa20/ChaCha family, now widely deployed in TLS and other protocols.

Part 9: Hash Functions#

  • Wang, X. and Yu, H. (2005). “How to Break MD5 and Other Hash Functions.” In Advances in Cryptology — EUROCRYPT 2005, LNCS 3494, 19–35. Springer. — Demonstrates practical collision attacks on MD5 using differential path techniques.

  • Wang, X., Yin, Y.L., and Yu, H. (2005). “Finding Collisions in the Full SHA-1.” In Advances in Cryptology — CRYPTO 2005, LNCS 3621, 17–36. Springer. — Extends collision techniques to SHA-1, precipitating its deprecation.

  • Bertoni, G., Daemen, J., Peeters, M., and Van Assche, G. (2013). “Keccak.” In Advances in Cryptology — EUROCRYPT 2013, LNCS 7881, 313–314. Springer. — Overview of the Keccak sponge construction, selected as SHA-3.

  • Preneel, B. (2010). “The State of Hash Functions.” In Information Security and Cryptology, LNCS 6584, 1–12. Springer. — Survey of hash function security in the wake of the MD5 and SHA-1 breaks.

Part 10: Public-Key Cryptography — RSA#

  • Rivest, R.L., Shamir, A., and Adleman, L. (1978). “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM, 21(2), 120–126. — The paper that introduced RSA, launching the public-key revolution.

  • Lenstra, A.K., Lenstra, H.W., Manasse, M.S., and Pollard, J.M. (1993). “The Number Field Sieve.” In The Development of the Number Field Sieve, LNM 1554, 11–42. Springer. — Description of the Number Field Sieve, the asymptotically fastest known classical factoring algorithm.

  • Boneh, D. (1999). “Twenty Years of Attacks on the RSA Cryptosystem.” Notices of the AMS, 46(2), 203–213. — Excellent survey of attacks on RSA including low-exponent, timing, and lattice-based attacks.

  • Diffie, W. and Hellman, M.E. (1976). “New Directions in Cryptography.” IEEE Transactions on Information Theory, 22(6), 644–654. — The seminal paper proposing public-key cryptography and the Diffie-Hellman key exchange.

Part 11: Elliptic Curve Cryptography#

  • Koblitz, N. (1987). “Elliptic Curve Cryptosystems.” Mathematics of Computation, 48(177), 203–209. — One of the two independent proposals for elliptic curve cryptography.

  • Miller, V.S. (1986). “Use of Elliptic Curves in Cryptography.” In Advances in Cryptology — CRYPTO ‘85, LNCS 218, 417–426. Springer. — The other independent proposal for ECC.

  • Silverman, J.H. (2009). The Arithmetic of Elliptic Curves. 2nd edition. Springer. — The standard mathematical reference for the algebraic geometry underlying ECC.

  • Galbraith, S.D. (2012). Mathematics of Public Key Cryptography. Cambridge University Press. — Comprehensive treatment of the mathematical foundations of public-key cryptography including detailed coverage of elliptic curve attacks.

Part 12: Lattice Cryptography#

  • Lenstra, A.K., Lenstra, H.W., and Lovász, L. (1982). “Factoring Polynomials with Rational Coefficients.” Mathematische Annalen, 261, 515–534. — Introduces the LLL lattice basis reduction algorithm, foundational to lattice-based cryptanalysis.

  • Regev, O. (2009). “On Lattices, Learning with Errors, Random Linear Codes, and Cryptography.” Journal of the ACM, 56(6), Article 34. — Introduces the Learning With Errors (LWE) problem with worst-case to average-case reductions, the theoretical foundation of most lattice-based cryptography.

  • Peikert, C. (2016). “A Decade of Lattice Cryptography.” Foundations and Trends in Theoretical Computer Science, 10(4), 283–424. — Comprehensive survey of lattice-based cryptography covering both constructions and attacks.

  • Micciancio, D. and Regev, O. (2009). “Lattice-based Cryptography.” In Post-Quantum Cryptography, 147–191. Springer. — Accessible introduction to the theoretical underpinnings of lattice crypto.

Part 13: Quantum Cryptanalysis#

  • Shor, P.W. (1997). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.” SIAM Journal on Computing, 26(5), 1484–1509. — The landmark paper demonstrating that quantum computers can factor integers and compute discrete logarithms in polynomial time.

  • Grover, L.K. (1996). “A Fast Quantum Mechanical Algorithm for Database Search.” In Proceedings of the 28th ACM Symposium on Theory of Computing, 212–219. — Introduces Grover’s search algorithm, providing quadratic speedup for unstructured search and effectively halving symmetric key lengths.

  • Nielsen, M.A. and Chuang, I.L. (2010). Quantum Computation and Quantum Information. 10th Anniversary edition. Cambridge University Press. — The standard textbook on quantum computing, essential for understanding the algorithmic foundations of quantum cryptanalysis.

  • Preskill, J. (2018). “Quantum Computing in the NISQ Era and Beyond.” Quantum, 2, 79. — Contextualises the near-term prospects for quantum computing, relevant to assessing the timeline of quantum threats to cryptography.

Part 14: Post-Quantum Standards#

  • NIST (2024). Post-Quantum Cryptography Standardization. https://csrc.nist.gov/projects/post-quantum-cryptography — The official NIST project page documenting the multi-round standardisation process.

  • Avanzi, R. et al. (2024). “CRYSTALS-Kyber (ML-KEM).” NIST FIPS 203. — The specification of the lattice-based key encapsulation mechanism selected as a NIST standard.

  • Bai, S. et al. (2024). “CRYSTALS-Dilithium (ML-DSA).” NIST FIPS 204. — The specification of the lattice-based digital signature scheme selected as a NIST standard.

  • Bernstein, D.J., Buchmann, J., and Dahmen, E. (eds.) (2009). Post-Quantum Cryptography. Springer. — Early comprehensive survey of post-quantum cryptographic approaches, prescient in identifying the families that would later dominate the NIST competition.

  • Aumasson, J.-P. (2024). “SPHINCS+ (SLH-DSA).” NIST FIPS 205. — The specification of the hash-based signature scheme selected as a NIST standard.

Part 15: Code-Based Frontiers#

  • McEliece, R.J. (1978). “A Public-Key Cryptosystem Based on Algebraic Coding Theory.” DSN Progress Report, 42-44, 114–116. — The original proposal for a code-based public-key cryptosystem, now a leading post-quantum candidate under the name Classic McEliece.

  • Berlekamp, E.R., McEliece, R.J., and van Tilborg, H.C.A. (1978). “On the Inherent Intractability of Certain Coding Problems.” IEEE Transactions on Information Theory, 24(3), 384–386. — Proves NP-hardness of the general decoding problem, the theoretical foundation of code-based cryptography.

  • Prange, E. (1962). “The Use of Information Sets in Decoding Cyclic Codes.” IRE Transactions on Information Theory, 8(5), 5–9. — Introduces information set decoding, the most important family of algorithms for attacking code-based cryptosystems.

  • May, A., Meurer, A., and Thomae, E. (2011). “Decoding Random Linear Codes in \(\tilde{O}(2^{0.054n})\).” In Advances in Cryptology — ASIACRYPT 2011, LNCS 7073, 107–124. Springer. — State-of-the-art ISD variant establishing key complexity bounds for code-based security.

  • Castryck, W. and Decru, T. (2023). “An Efficient Key Recovery Attack on SIDH.” In Advances in Cryptology — EUROCRYPT 2023, LNCS 14008, 423–447. Springer. — The devastating polynomial-time attack on SIDH/SIKE, a cautionary tale for the post-quantum community.

General References and Textbooks#

  • Katz, J. and Lindell, Y. (2020). Introduction to Modern Cryptography. 3rd edition. CRC Press. — The standard graduate textbook, combining rigorous definitions with broad coverage.

  • Boneh, D. and Shoup, V. (2020). A Graduate Course in Applied Cryptography. Available at https://toc.cryptobook.us/. — Freely available online textbook with excellent coverage of both theory and practice.

  • Stinson, D.R. and Paterson, M. (2018). Cryptography: Theory and Practice. 4th edition. CRC Press. — Balanced treatment of classical and modern cryptography with good problem sets.

  • Menezes, A.J., van Oorschot, P.C., and Vanstone, S.A. (1996). Handbook of Applied Cryptography. CRC Press. — Encyclopaedic reference covering algorithms, protocols, and implementation considerations. Freely available online.

  • Bernstein, D.J. and Lange, T. (2017). “Post-quantum cryptography.” Nature, 549, 188–194. — Accessible overview of the post-quantum cryptography landscape for a general scientific audience.

  • Schneier, B. (2015). Applied Cryptography. 20th Anniversary edition. Wiley. — Widely-read practical reference, best used in conjunction with more theoretically rigorous texts.

[1]

William F. Friedman. The index of coincidence and its applications in cryptanalysis. Riverbank Publication, 1922.

[2]

missing journal in kasiski1863geheimschriften

[3]

Simon Singh. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Doubleday, 1999.

[4]

Abraham Sinkov. Elementary Cryptanalysis: A Mathematical Approach. Mathematical Association of America, 1966.

[5]

Friedrich L. Bauer. Decrypted Secrets: Methods and Maxims of Cryptology. Springer, 4th edition, 2007.

[6]

Claude E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28(4):656–715, 1949.

[7]

Claude E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27(3):379–423, 1948.

[8]

Auguste Kerckhoffs. La cryptographie militaire. Le Journal des Sciences Militaires, 1883.

[9]

Eli Biham and Adi Shamir. Differential cryptanalysis of des-like cryptosystems. Journal of Cryptology, 4(1):3–72, 1991.

[10]

Mitsuru Matsui. Linear cryptanalysis method for des cipher. In Advances in Cryptology — EUROCRYPT '93, volume 765 of LNCS, 386–397. Springer, 1994.

[11]

Howard M. Heys. A tutorial on linear and differential cryptanalysis. In Cryptologia, volume 26, 189–221. 2002.

[12]

Don Coppersmith. The data encryption standard (DES) and its strength against attacks. IBM Journal of Research and Development, 38(3):243–250, 1994.

[13]

Kaisa Nyberg. Differentially uniform mappings for cryptography. In Advances in Cryptology — EUROCRYPT '93, volume 765 of LNCS, 55–64. Springer, 1994.

[14]

Joan Daemen and Vincent Rijmen. The Design of Rijndael: AES — The Advanced Encryption Standard. Springer, 2002.

[15]

Andrey Bogdanov, Dmitry Khovratovich, and Christian Rechberger. Biclique cryptanalysis of the full AES. In Advances in Cryptology — ASIACRYPT 2011, volume 7073 of LNCS, 344–371. Springer, 2011.

[16]

Nicolas T. Courtois and Willi Meier. Algebraic attacks on stream ciphers with linear feedback. In Advances in Cryptology — EUROCRYPT 2003, volume 2656 of LNCS, 345–359. Springer, 2003.

[17]

Nicolas T. Courtois and Josef Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. In Advances in Cryptology — ASIACRYPT 2002, volume 2501 of LNCS, 267–287. Springer, 2002.

Contents