Computer Science

This cryptography courses consists of the lectures "Public Key Cryptography" and "Cryptography for Security" as well as a practice session. Public Key Cryptography examines common methods in asymmetric encryption, as well as possible attacks in faulty implementation of these methods. Topics include RSA (including signatures), attacks on small public exponent, Wiener attack, primality tests and factorization, El-Gamal, Diffie-Hellman-Key-Exchange, elliptic curves, attacks on the discrete logarithm, and selected methods of Post-Quantum-Cryptography. Cryptography for Security discusses fundamental concepts of encryption as well as their construction and their connections, classical cryptographic problems and how to solve them, formal notions of security, One-Way-Functions, (Pseudo-)Random-Number-Generators, and Pseudo-Random-Functions. Practice sessions alternate between two formats that are both primarily focused on attacks learned in class. In the first, students read encryption code and write a corresponding decryption algorithm. In the second, students prove theorems/attacks' effectiveness and make calculations by hand, often involving topics in ring theory, field theory, and group theory.

This course examines the roll of databases in an Information System. Topics include: data life cycle; data modeling-- describing data at different levels; components of a database management system (DBMS); relational data model; use of a declarative query language-- SQL; data governance and information management roles; managing unstructured data-- SQL and noSQL databases.