This course provides introduction to cryptographic algorithms. It focuses on how cryptographic algorithms work and how to use them. The course starts with some basic mathematics covering set theory, groups (Abelian, Cyclic, generator, group order), Rings, Fields, Euclidian algorithm, Chinese Remainder Theorem (CRT). Next, the course covers the concepts of block and stream ciphers, symmetric key encryption algorithms, public key encryption algorithm, message authentication codes, digital signatures, key management, and common examples and uses of such algorithms.
Undergraduate 132 CRs
William Stallings, Cryptography and Network Security: Principles and Practice, Pearson Jonathan Katz and Y. Lindell, Introduction to Modern Cryptography, CRC Press
| content serial | Description |
|---|---|
| 1 | Course Introduction and Syllabus discussion |
| 2 | Introduction to Number Theory |
| 3 | Classical Encryption Techniques |
| 4 | Block ciphers and the Data Encryption Standard |
| 5 | Finite Fields and Advanced Encryption standard |
| 6 | Block cipher operation |
| 7 | Random bit generation and stream ciphers |
| 8 | 7th week Assessment |
| 9 | Public-key cryptography and RSA |
| 10 | Other Public Key cryptosystems |
| 11 | Cryptographic Hash functions and Message Authentication Codes |
| 12 | 12th week Assessment and Digital Signatures |
| 13 | Cryptographic Key Management and Distribution |
| 14 | Cryptographic Key Management and Distribution (cont.) |
| 15 | Introduction to Quantum and Post-Quantum Cryptography |
Start your application
