Course Aim: Introduce students to classical cryptosystems and basic notions from public key cryptography as well as basic number-theoretic methods and algorithms for cryptanalysis of protocols.
Main Topics: One-time pads - perfect secrecy - public key ciphers: RSA - discrete log. Euclidean algorithm - finite fields - quadratic reciprocity - message digest - hash functions - protocols: key exchange - secret sharing - zero-knowledge proofs. Also - Probabilistic algorithms: pseudo-primes - prime factorization - pseudo-random numbers - elliptic curves.
Main Topics: One-time pads - perfect secrecy - public key ciphers: RSA - discrete log. Euclidean algorithm - finite fields - quadratic reciprocity - message digest - hash functions - protocols: key exchange - secret sharing - zero-knowledge proofs. Also - Probabilistic algorithms: pseudo-primes - prime factorization - pseudo-random numbers - elliptic curves.
- Teacher: abeer Saeed Amir Walid
- Teacher: ahmed Mohammed Faisal Faisal
- Teacher: aya Saad Omar Khalid