Course Information
COMP3357 Cryptography

COMP3357 Cryptography

2019-20
Instructor(s):Ramanathan Ravishankar
(Class A) No. of credit(s):6
Recommended Learning Hours:
Lecture: 35.0
Tutorial: 4.0
Pre-requisite(s):MATH1853 or MATH2101
Co-requisite(s):  
Mutually exclusive with:  
Remarks:

Course Learning Outcomes

1. [Basic working knowledge] Understand the basic elementary knowledge of one-way function, such as discrete logarithm and RSA. Learn the elementary tools of pseudorandom number generator. Be familiar with tools of quantum information theory. Understand the basics of modern quantum cryptography including quantum key distribution and quantum random number generation.
2. [Problem modeling] Model the security requirements of confidentiality, integrity and authentication, such as the Chosen Ciphertext Attack (CCA) model. Model cryptographic tasks in quantum theory.
3. [Problem solving] Understand the difference between cryptographic primitives like hash function, symmetric key encryption, public key encryption and digital signatures. Apply different cryptographic primitives in practical applications. Establish the security of simple protocols for quantum key distribution and random bit generation.
4. [Self-learning] Able to self-learn basic topics in cryptography come up with creative solutions to simple problems
Mapping from Course Learning Outcomes to Programme Learning Outcomes
 PLO aPLO bPLO cPLO dPLO ePLO fPLO gPLO hPLO iPLO j
CLO 1T
CLO 2TTTT
CLO 3TTTTT
CLO 4T

T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to here.

Syllabus

Calendar Entry:
This course offers a gentle introduction to the field of cryptography. We will start from the basic principles of confidentiality, integrity and authentication. After that, we will go through some fundamental cryptographic primitives like hash function, symmetric key encryption, public key encryption and digital signatures. Finally, we will introduce the basics of quantum cryptography including quantum key distribution and random number generation.

Detailed Description:

Introduction to Modern Cryptography Mapped to CLOs
Modern Cryptography: A Computational Complexity Based Theory1
One-way and trapdoor functions1
Pseudo-random bit generators1
Fundamental ideas of Quantum Information1
Basics of Quantum Cryptography1
Hash Function & Symmetric Cryptography Mapped to CLOs
Block ciphers2, 3
Stream ciphers2, 3
MAC and Hash Functions2, 3
Public Key Cryptography Mapped to CLOs
Public-key encryption2, 3
Digital signatures2, 3
Protocols: Identification and authenticated key exchange2, 3
Cryptographic applications in E-commerce3, 4
Quantum Cryptography Mapped to CLOs
Quantum key distribution. BB84 and practical quantum cryptography2, 3
Device-independent random bit generation.2, 3

Assessment:
Continuous Assessment: 50%
Written Examination: 50%

Teaching Plan

Please refer to the corresponding Moodle course.

Moodle Course(s)