COMP61411 Cryptography syllabus 2019-2020
Cryptographic techniques today lie at the heart of the strategies used to protect users' data from unauthorised access. They come into their own particularly when data has to be transmitted across unreliable and unprotected networks.
The course aims to give students a good appreciation of cryptographic techniques, as they have arisen historically, and as they are used today.
- Early cryptography: permutations and substitutions, Vignere, Vernam, one time pads, etc.
- Rotor machines: Enigma and its relatives.
- Case study: Marian Rejewski and the breaking of the German Enigma.
- Modern cryptography, secret key: block cyphers, DES, AES, etc.
- Modern cryptography, public key: Diffie-Hellman, RSA, elliptic curves.
- Message authentication, hash functions.
- Quantum cryptography: quantum key distribution in practice.
Feedback methodsFeedback is provided face to face in the lab, and online for uploaded assessed materials.
- Assessment written exam (2 hours)
- Lectures (20 hours)
- Practical classes & workshops (15 hours)
- Analytical skills
- Problem solving
On successful completion of this unit, a student will be able to:
- Comment on the broad principles underlying cryptography and its applications.
- Describe some of the classical cryptographic techniques and their weaknesses.
- Describe the principles of the most widely used private key cryptographic schemes.
- Describe the principles of the most widely used public key key cryptographic schemes.
|Cryptography and network security: principles and practice (7th edition)||Stallings, William||9781292158587||Pearson||2017||✔|
Course unit materials
Links to course unit teaching materials can be found on the School of Computer Science website for current students.