1. electronically for the module
2. You have to register yourself in Moodle using your BTU account.
There is no password required, registration can be done immediately.
- first lecture: 2 April 2019. Here we shall also discuss potential changes of the lecturing hours.
- first exercise: 5 April 2019
- Final exam: The final exam will be either a written or an oral one, depending on the number of participants.
More details will be given during the course.
- Important information on prerequisites: 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.
- 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 Cryprography - Volume I Basic Tools, Cambridge University Press 2001
- J. Rothe: Komplexitätstheorie und Kryptologie (in German), Springer 2008
- D.R. Stinson: Cryprography - Theory and Practice, CRC Press 1995