CS 411/507 Cryptography

Fall Term 2009
Computer Science
Sabanci University


 


Textbook

W. Trappe & L. C. Washington. Introduction to Cryptography with Coding Theory, 2nd Edition, Prentice-Hall, 2006. ISBN: 0-13-198199-4.

Recommended resources

  • J. Menezes, P. C. van Oorschot and S. A. Vanstone. Handbook of Applied Cryptography, CRC Press, 1997. ISBN: 0-8493-8523-7.Most of the chapters of this book is available online free of charge. Please click on the name of the book to access to the chapters in pdf format. And please read the copyright notice.
  • D. R. Stinson, Cryptography, Theory and Practice, 3rd Edition, Chapman & Hall/CRC, 2006. ISBN: 1-58488-508-4.
  • W. Mao, Modern Cryptography: Theory and Practice. Prentice Hall, 2004.
  • B. Schneier, Applied Cryptography, 2nd Edition, John Wiley & Sons, 1996.

Time & Place

  • Monday 16:40 - 17:30 FENS L035
  • Tuesday 10:40 -  12:30 FENS L035

Motivation

This is an introductory course on the methods, algorithms, techniques, and tools of data security and cryptography. After studying the theoretical aspects of cryptographic algorithms and protocols, we show how these techniques can be integrated to solve particular data and communication security problems. This course material is of use to computer and communication engineers who are interested in embedding security into an information system, and thus, providing integrity, confidentiality, and authenticity of the documents and the communicating parties.

Topics

  • Introduction and Classical Cryptosystems: Secure communication. Attacks to cryptosystems. Classical cryptographic techniques and algorithms. One time pad, randomness and pseudo-randomness
  • Mathematical Foundations: Number theory. Finite fields. Primitive roots. Squareroots. Exponentiation and discrete logarithm.
  • Secret-Key Cryptography: Block ciphers and stream ciphers. DES, AES (Rijndael). Modes of operation.
  • Public-Key Cryptography: One-way functions. Trapdoor one-way functions. Public-key cryptosystems. RSA, Diffie-Hellman, ElGamal, and elliptic curve cryptosystems.
  • Authentication and Digital Signatures: Cryptographic checksums. Hash functions and message-digest functions. Digital signatures. Authentication protocols.
  • Protocols: Digital cash. Sharing and partial disclosure of secrets. Games. Zero-knowledge proof systems. Identification protocols. Key management architectures.
  • Quantum Cryptography Quantum key exchange

Homework Assignments

Handwritten assignments are not acceptable


Examinations


Course Materials

  • Introduction, 
  • classic ciphers, 
  • number theory,
  • stream ciphers   
  • block ciphers & DES, 
  • Advanced Encryption Standard(AES)
  • Public Key Cryptography and RSA
  • Discrete Logarithm
  • Elliptic Curve Cryptography
  • Digital Signatures
  • Secret Sharing
  • Games
  • Zero Knowledge Protocols
  • Key Establishment Protocols
  • Digital Cash
  • Fair Cryptography

 


Tentative grading

  • Midterms: 30 %
  • Final: 35 %
  • HW Assignments: 15 %
  • Project: 20 %

Important Dates

  • First midterm: TBA 
  • Final: As scheduled by registrar

Class Projects for Fall 2009

  • Project Requirements
  • Proposal Due Date: TBA.
  • Electronic Copy Due Date: TBA

Links for Cryptographic Information


Resources and Pointers


Prerequisites

This class is open to graduate and graduate students. Experience in C/C++ is required.

Dr. Erkay Savas