Syllabus Cryptography and Network Security

Instructor : Dr. Albert Jeng

Syllabus :

  1. Introduction
    – What is cryptology : (cryptography + cryptanalysis )
    – overview of crytology : How cryptography works ?, how to break a cryptographic system ?,
    classical conventional encryption, modern conventional encryption, public key encryption,
    Hashing algorithm.
    – mathematical background : review probability theory, information theory, complexity theory,
    number theory, abstract algebra, finite field,etc and their relationship cryptology.
  2. Symmetric-Key Cryptography (including DES, Triple-DES, AES, and design of Symmetric Key Cryptosystems)
  3. Hasing function and message authentiaction code (MAC) (including MD5, SHA-1, HMAC and comparative Analysis)
  4. Public Key Cryptosystems (including principles of public key cryptosystems, Diffie Hellman key exchange, RSA cryptosystems, ElGamal Cryptosystems, Elliptic Curve Cryptography, Digital Signature, and Symmetric key vs. public key cryptosystems)
  5. Key management and public key infrastructure (PKI) (Including key servers, X.509 certificates, PKI reality, PKI practicalities, and PKI interoperability)
  6. Cryptanalysis (Differential Cryptanalysis, Linear Cryptanalysis, Truncated differential cryptanalysis, etc)
  7. Miscellaneous (including Cryptographic standards, application of cryptosystems, network security (IPSEC, VPN, Web Security), privilege management infrastructure (PMI) and Access Control, e-Commerce and Smart IC cards)

Textbook :
W. Stallings, Crytography and Network Security : Princiles and Practice, 4/E, Prentice Hall, 2006.

Reference :

  1. D. Stinson, Cryptography : Theory and Practice 2nd Edition, 2004 published by Chapman & Hall/CRC
  2. http://www.cacr.math.uwaterloo.ca/hac/

Grading systems :

  1. Homework + attending  : 50 points
  2. Mid-Term Exam               : 100 points
  3. Final Exam                      : 150 points
  4. Group Term Project        : 100 points

Comments are closed.

%d bloggers like this: