To introduce both theoretical and practical aspects of cryptography, authentication and information security.
On successful completion of this module, the students should be able to understand the principles of cryptographic techniques and perform implementations of selected algorithms in this area; be able to apply relevant mathematical techniques; appreciate the application of security techniques in solving real-life security problems in practical systems.
Basic terminology and concepts:
Goals of cryptography, terminology and notation, players, basic cryptographic functions
Congruent modulo n, equivalent class modulo n, Integer modulo n (Zn),
Multiplicative inverse, Relatively prime, Euler's theorem, Fermat's little theorem, EEA (Extended Euclidean Algorithm), CRT (Chinese Remainder Theorem)
Block ciphers (substitution, transposition, product)
Modes of operation (ECB, CBC, CFB, OFB)
Block cipher: DES (Data Encryption Standard), AES (Advanced Encryption Standard)
Public-key: RSA (Rivest-Shamir-Adelman), El gamal
One-way hash function: SHA and MD5 (Message Digest 5)
Symmetric and asymmetric techniques (Diffie-Hellman, Needham-Schroeder, Otway-Rees), Public-key
encryption, basic and advanced Kerberos protocols
Authentication and identification:
Concepts, Fiat-Shamir and Feige-Fiat-Shamir protocols, Zero-knowledge identification protocol
Digital signature schemes: RSA, El-Gamal, DSA (Digital Signature Algorithm) and DSS (Digital Signature Standard)
Password systems, viruses, social engineering, firewalls, buffer overflow, denial of services"
Module assessment - more information