The course at many places is relying on basic knowledge about discrete mathematics that you should have learned in your Bachelor's education. Typical examples are a basic familiarity with concepts such as groups, rings, and (finite) fields, vector spaces, basic number theoretic statements and algorithms such as prime number decomposition, the (extended) Euclidean algorithm, the Chinese Remainder Theorem etc. Though in the run of the course we briefly address those things again when they come up you are strongly recommended to  study them early again in textbooks as soon as you have the feeling that your knowledge or remembrance is not sufficient. Most of the books in the reference list contain brief surveys on these topics.


  • Cyber Security M. Sc.: Mandatory module in complex "Cyber Security Basics".
  • Applied Mathematics M. Sc.: Part of the complex "Mathematics Enhancement".
  • Information and Media Technology M. Sc.: Part of the complex "Fundamental Methods".
  • Computer Science M. Sc.: Compulsory elective module in "Mathematics" or in field of application "Mathematics".
  • Modul 11859
    8 KP, 4 SWS VL, 2 SWS UE

Additional literature

  • G. Baumslag, B. Fine, M. Kreuzer, G. Rosenberger: A course in mathematical cryptography, De Gruyter Graduate 2015
  • J. Buchmann: Einführung in die Kryptographie (in German), Springer 2016
  • V. Diekert, M. Kufleitner, G. Rosenberger: Diskrete Algebraische Methoden (in German), De Gryuter Studium 2013; the book in the meanwhile is also available in English
  • J. Hoffstein, J. Pipher, J.S. Silverman: An Introduction to Mathematical Cryptography, 2nd edition, 2014 Springer
  • O. Goldreich: Foundations of Cryptography - Volume I Basic Tools, Cambridge University Press 2001
  • J. Rothe: Komplexitätstheorie und Kryptologie (in German), Springer 2008
  • D.R. Stinson: Cryptography - Theory and Practice, CRC Press 1995