This course aims at providing further theoretical background on the algebraic aspects of common cryptographic primitives, in addition to the core courses of the program. Discrete Logartihm Problem is deeply explored in multiplicative setup (Diffie-Hellman, DSA, El-Gamal) as well as in additive setup (elliptic curves). Algebraic cryptanalysis methods on these discrete logarithm problems are explained.