Resources

Readings References CrypTool

Cryptography References

The following is a list of references that I have found useful. It is by no means exhaustive. The books are listed first and then the journal articles. They range from the expository to the very mathematical.

Cryptology Books:

  1. Bauer, Friedrich. Decrypted Secrets: Methods and Maxims of Cryptology. Fourth Edition. Springer, 2006.
  2. Flanner, Sarah, with David Flannery. In Code: A Mathematical Journey. Chapel Hill, NC: Algonquin Books of Chapel Hill, 2002.
  3. Gaines, Hellen F. Cryptanalysis: a study of ciphers and their solutions. Dover, 1989.
  4. Lewand, Robert F. Cryptological Mathematics. Mathematical Association of America, 2009.
  5. Schneier, Bruce. Applied Cryptography. Second Edition. John Wiley & Sons, 1996.
  6. Sinkov, Abraham. Elementary Cryptanalysis. Second Edition. Mathematical Association of America, 2009.
  7. Singh, Simon. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. New York: Anchor Books, 2000.
  8. Van Assche, Giles. Quantum Cryptography and Secret-Key Distillation. Cambridge UP, 2006.

Mathematical Cryptography & Number Theory References:

  1. Hoffstein, J., Pipher, J., Silverman, J.H. An Introduction to Mathematical Cryptography. Springer, 2009.
  2. Koblitz, Neal. A Course in Number Theory and Cryptography. 2nd Edition. New York: Springer-Verlag, 1994.
  3. Rosen, Kenneth H. Elementary Number Theory and its appications. Fifth Edition. Boston: Pearson Addison-Wesley, 2005.

Seminal Journal Articles: The articles listed in this section each mark a major advance in 20th century cryptography. I have also listed the original papers developing the Hill Cipher in this section.

  1. Diffie, W., and M.E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory 22, no. 6(November 1976): 644-654
  2. Elgamal, T. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory 31, no. 4(July 1985): 469-472
  3. Hellman, M.E. An Overview of Public Key Cryptograhpy. IEEE Communications Magazine, 50th Anniversary Commemorative Issue(May 2002): 42-29
  4. Hill, L.S. Concerning Certain Linear Transformation Apparatus of Cryptography. The American Mathematical Monthly (Mathematical Association of America), no.3(March 1931): 135-154
  5. Hill, L.S. Cryptography in an Algebraic Alphabet. The American Mathematical Monthly (Mathematical Association of America) 65, no. 6(June-July 1929): 306-312
  6. Levine, Jack. Variable Matrix Substitution in Algebraic Cryptography. The American Matheamtical Monthly (Mathematial Association of America) 65, no. 3(March 1938): 170-179
  7. Merkle, R.C., and M.E. Hellman. Hiding Information and Signatures in Trapdoor Knapsacks. IEEE Transactions on Information Theory. 24, no. 5 (September 1978): 525-530
  8. Rivest, R.C., A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptostystems. Communications of the ACM 21, no. 2 (February 1978): 120 - 126.

Expository Journal Articles: The articles in this section are all non-technical in nature. They can be read by anyone intersted in obtaining a background in Cryptology. The Blake-Wilson paper is an examination of the interdisciplinary nature of the subject. The Diffie-Hellman paper is an overview of classical cryptography through early digital methods and contains an extensive bibliography. The Koblitz-Menzes paper is a reveiw of modern digital cryptography, and they cover topics such as RSA, Elliptic Curves, and Braid Groups.

  1. Blake-Wilson, S. Information Security, Mathematics, and Public-Key Cryptography. Designs, Codes, and Cryptography (Kluwer Academic Publishers) 19(2000): 77-99.
  2. Diffie, W., and M.E. Hellman. Privacy and Authentication: An Introduction to Cryptography. Proceedings of the IEEE 67, no. 3 (March 1979): 397 - 427
  3. Koblitz, N., and A.J. Menezes. A Survey of Public-Key Cryptosystems. SIAM Review (Society for Industrial and Appied Mathematics) 46, no. 4 (December 2004): 599-634.

Journal Articles on RSA:

  1. Boneh, D. Twenty Years of Attacks on the RSA Cryptosystem. Notices of the AMS 46, no. 2(February 1999): 203-213
  2. Brincat, K. On the Use of RSA as a Secret Key Cryptosystem. Designs, Codes and Cryptography(Kluwer Academic Publishers), 2001: 317-328
  3. Shamir, A. How to Share a Secret. Communications of the ACM 22, no. 11 (November 1979): 612-613

Journal Articles on Knapsack Ciphers:

  1. Odlyzko, A. The Rise and Fall of Knapsack Cryptosystems. in Cryptology and Computational Number Theory, Proceedings Symposia Applied Mathematics. Providence: AMS, 1990. 75-88.

Mathematical Journal Articles: These articles are heavy on the mathematics. A background in abstract algebra and number theory is required to understand them. In particular, one should be familiar with fields of characteristic p. These are each well-known articles in mathematical cryptology.

  1. Blomer, J, and A. May. A Generalized Wiener Attack on RSA. In PKC 2004, LNCS 2947, edited by F. Bao and et al., 1-13. 2004.
  2. Nguyen, P.Q., J. Stern. The Two Faces of Lattices in Cryptology in CaLC 2001, LNCS 2146, edited by J.H. Silverman, 146-180. Berlin-Heidelberg: Springer-Verlag, 2001.
  3. Pohlig, S., and M.E. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographyic Significance. IEEE Transactions on Information Theory 24, no. 1 (January 1978): 106-110.
  4. Wiener, M.J. Cryptanalysis of Short RSA Secret Exponents. IEEE Transactions on Information Theory 36, no. 3 (May 1990): 553-558.