This module introduces the learner to the basic concepts of Cryptology and the applications of Number Theory and Algebra to Cryptosystems.
*Curricular information is subject to change
Classic Cryptology: Some simple cryptosystems, shift and affine transformations, enciphering matrices.
Public Key Cryptology: The idea of Public Key Cryptology, Finite Fields, Euler Phi Function, Chinese Remainder Theorem, Fermat and Euler Theorems, Discrete Logarithms, Modular Exponentiation, RSA Encryption. Basics of Elliptic curves and their applications to Cryptography.
Lectures supported by problem-solving sessions.
| Module Content & Assessment | |
|---|---|
| Assessment Breakdown | % |
| Formal Examination | 75 |
| Other Assessment(s) | 25 |