Document Actions
MATH236 (P1 W1)
|
|
Discrete Mathematics with Applications |
|
|
16 |
|
|
|
|
|
To study basic concepts of Discrete Mathematics & applications to Cryptology and Graph Theory. |
|
|
Basic set theory. Relations & functions, equivalence relations. Counting principles, inclusion-exclusion & pigeonhole principles, combinations, identities with binomial coefficients. Modular arithmetic, basic number theory: GCD, extended Euclidean algorithm, Euler’s totient function, basic group theory, Fermat’s Little Theorem, Euler’s Theorem. Cryptology: encryption, decryption of well known private-key cryptosystems, cryptanalysis of shift, substitution & Vigenère ciphers, stream ciphers, Shannon theory, public key cryptography, product cryptosystems. Recursions & generating functions. |
|
|
Class mark (33%), 3h exam (67%). |
|
|
35% Class mark, 80% attendance at lectures & tutorials. |
|
|
in Semester 1. |