bldg. 70B, room 3657,
(585) 475-5193, email@example.com
office hours: M 4-5pm, TR 8-9pm (if nobody comes by 8:15pm I may go home), or send email
Tuesday/Thursday, 6-8pm, room 70-3560
Books and Other Reading
- Douglas R. Stinson,
Cryptography: Theory and Practice, CRC Press,
third edition 2006, (required textbook.)
Known errors for the second edition are posted.
- Wade Trappe and Lawrence C. Washington,
Introduction to Cryptography with Coding Theory,
Prentice Hall 2002, 2006 (other section textbook.)
- A. J. Menezes, P. C. van Oorschot and S. A. Vanstone,
CRC Handbook of Applied Cryptography, CRC Press 1996 (great addition
to your bookshelf).
Niels Ferguson, Bruce Schneier and Tadayoshi Kohno,
Cryptography Engineering, John Wiley & Sons 2010
Cryptography and Network Security. Principles and Practice,
Prentice Hall, fifth edition 2011 (popular textbook elsewhere.)
- Bruce Schneier,
Applied Cryptography, John Wiley & Sons 1994 (popular textbook elsewhere.)
- Paul Garrett,
Making, Breaking Codes. An Introduction to Cryptology,
Prentice Hall 2001.
- Richard A. Mollin,
An Introduction to Cryptography,
Chapman & Hall/CRC 2001.
- Simon Singh, The Code Book, the evolution of secrecy from Mary,
Queen of Scots, to quantum cryptography, Doubleday 1999.
- Stefan Katzenbeisser and Fabien A.P. Petitcolas (editors),
Information Hiding, techniques for steganography and
digital watermarking, Artech House 2000.
- Journal articles.
General knowledge of programming.
Background in combinatorics and discrete mathematics.
(4003-334 or 4003-263) and 1016-265,
or permission of the instructor.
- 45% Homeworks
- 25% Midterm Exam, Tuesday, January 15, 6pm-8pm, 70-3560
- 30% Final Exam, Tuesday, February 19, 6pm-8pm, 70-3560
The course is devoted to the review of basic cryptographic
algorithms, their implementations and usage. Classical encryption
techniques and those of Diffie-Hellman and Rivest-Shamir-Adleman will be
seen in depth, and an overview of several others will be presented,
especially those denominated as public-key cryptosystems. The symmetric
systems DES and AES, and others, will be studied.
The course also presents digital signatures, hash functions,
authentication schemes and some interactive proof protocols.
The evaluation of undergraduate and graduate students will be
based on the same items, except that specific requirements of
some will be more extensive for graduate students. This will
include more difficult requirements for programming assignments
and additional problems on standard homeworks.
The specific topics will include
Introduction, need of security. History.
Substitution and monoalphabetic ciphers.
Vigenere cipher, coincidence index.
A touch of number theoretical algorithms.
Private key cryptography.
Data Encryption Standard - DES.
Rijndael, Advanced Encryption Standard - AES.
Secure hashing algorithms - SHA-family, NIST competition.
Public key cryptography. One-way functions.
Rivest-Shamir-Adleman cryptosystem - RSA. RSA-xxx challenge.
Overview of ElGamal cryptosystem, discrete logarithms, digital signatures.