Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Introduction to cryptography with coding theory, second edition

  • 1037 Accesses

  • 8 Citations

This is a preview of subscription content, log in to check access.


  1. [1]

    I. Anshel, M. Anshel, D. Goldfeld, An algebraic method for public-key cryptography.Math. Res. Lett. 6 (1999), 287–291.

  2. [2]

    Menezies, van Oorschot and Vanstone,Handbook of Applied Cryptography, CRC Press 1997.

  3. [3]

    A. Joux, Multicollisons in iterated hash functions. Application to cascaded constructions,Advances in Cryptology-CRYPTO 2004, Lecture Notes in Computer Science 3152, Springer-Verlag, 2004, 306–316.

  4. [4]

    P. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,Advances in Cryptology-CRYPTO 96, Lecture Notes in Computer Science 1109, Springer-Verlag, 1996, 104–113.

  5. [5]

    U. Maurer, Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms,Advances in Cryptology-Crypto ’94, Lecture Notes in Computer Science 839, Springer-Verlag, 1994, 271–281.

  6. [6]

    B. Schneier,Applied Cryptography, 2nd edition, John Wiley, 1996.

  7. [7]

    X. Wang, Y. Yin, H. Yu, Finding collisions in the Full SHA-1,Advances in Cryptology- Crypto 2005, Lecture Notes in Computer Science 3621, Springer-Verlag, 17–36.

Download references

Author information

Correspondence to Michael Anshel.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Anshel, M., Boklan, K.D. Introduction to cryptography with coding theory, second edition. The Mathematical Intelligencer 29, 66–69 (2007). https://doi.org/10.1007/BF02985694

Download citation


  • Hash Function
  • Elliptic Curve
  • Block Cipher
  • Stream Cipher
  • Convex Polyhedron