WS2023

• • Operating Systems

    • Additional assignment on Banker's algorithm including solution
      
    • How to config a ssh hop
      

SS2023

• • Embedded IT-Security

    • Slides from the first lecture
      
    • LAB01
      
    • Python script for "manual" flashing the CW-Lite (after an unsuccessful update of the firmware)
      
    • LAB02
      ciphertext for LAB02
      
    • project proposals
      
    • Slides from the last two lectures
      

SS2022

• • Post-Quantum Cryptography

    Joint lecture with Gustavo Banegas, Matthias Kannwischer, Michael Meyer and Steffen Reith at RheinMain University of Applied Sciences, Wiesbaden, Germany.

    • project proposals:

      • hash-based: Implementation and formal verification of WOTS using Jasmin and EasyCrypt (see https://blog.cloudflare.com/post-quantum-easycrypt-jasmin/ and Master’s Thesis of Meijers M.).
      • lattice-based: 3 project proposals.
      • code-based: Select a challenge, understand the background, and implement a toy example (or even including optmizations) for the chosen challenge.
      • isogeny-based: 3 project proposals.

    • useful preliminaries:

      • Handbook of Applied Cryptography
      • Impagliazzo’s Five Worlds
      • The state of tooling for verifying constant-timeness of cryptographic implementations

    • hash-based:

      • My slides and notes
      • Buchmann, J., Dahmen, E., Szydlo, M. (2009). Hash-based Digital Signature Schemes. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds) Post-Quantum Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88702-7_3
      • Tanja’s lectures on hash-based signatures: https://youtube.com/playlist?list=PL6hzlGxGIS1Bfhvrr5gD0etRG5ECJ-TVo

    • lattice-based:

      • Matthias’ slides 1st week
      • Matthias’ slides 2nd week
      • Wookiee assignment
      • Matthias Kannwischer. Polynomial Multiplication for Post-Quantum Cryptography. PhD Thesis. 2022. Radboud University, The Netherlands, Nijmegen [thesis]
      • Thomas Pöppelmann. Efficient implementation of ideal lattice-based cryptography. PhD Thesis. 2015. Ruhr-Universität Bochum.
        https://hss-opus.ub.ruhr-uni-bochum.de/opus4/frontdoor/deliver/index/docId/4917/file/diss.pdf
      • Chris Peikert. A Decade of Lattice Cryptography. Foundations and Trends in Theoretical Computer Science: Vol. 10: No. 4, pp 283-424, 2016.
        https://eprint.iacr.org/2015/939.pdf
      • Daniele Micciancio, and Oded Regev. Lattice-based Cryptography. 2008.
        https://cims.nyu.edu/~regev/papers/pqc.pdf
        Roberto Avanzi, Joppe Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehlé. Specification document of CRYSTALS-Kyber – Submission to round 3 of the NIST post-quantum project.
        https://pq-crystals.org/kyber/resources.shtml
      • Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehlé. Specification document of CRYSTALS-Dilithium – Algorithm Specifications and Supporting Documentation.
        https://pq-crystals.org/dilithium/resources.shtml

    • code-based:

      • Gustavo’s slides 1st week
      • Gustavo’s slides 2nd week
      • Overbeck, R., Sendrier, N. (2009). Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds) Post-Quantum Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88702-7_4
      • N. Sendrier, “Code-Based Cryptography: State of the Art and Perspectives,” in/IEEE Security & Privacy/, vol. 15, no. 4, pp. 44-50, 2017, doi: 10.1109/MSP.2017.3151345.
      • Berlekamp, E. R. “Error Correcting Codes for Digital Audio.”/Audio Engineering Society Conference: 1st International Conference: Digital Audio/. Audio Engineering Society, 1982.
      • Weger, Violetta, Niklas Gassner, and Joachim Rosenthal. “A Survey on Code-Based Cryptography.”/arXiv preprint arXiv:2201.07119/(2022).

  • • isogeny-based:

      • Craig Costello. Supersingular isogeny key exchange for beginners. SAC 2019. https://eprint.iacr.org/2019/1321
      • Tanja Lange. (C)SIDH – Isogeny School Week 3. https://www.hyperelliptic.org/tanja/teaching/isogeny-school21/
      • Luca De Feo. Mathematics of Isogeny Based Cryptography. https://arxiv.org/abs/1711.04062

WS2018/2019

• • Post-Quantum Cryptography (Master) – WS2018/2019

SS2018

• • Automatentheorie und Formale Sprachen (Bachelor) – SS2018

WS2017/2018

• • Diskrete Strukturen (Bachelor) – WS2017/2018

SS2017

• • Automatentheorie und Formale Sprachen (Bachelor) – SS2017

SS2016

• • Automatentheorie und Formale Sprachen (Bachelor) – SS2016

supervision

2019-2024

• • Bachelor thesis: Borg, L.: Evaluation des MAYO-Signaturverfahrens auf FPGAs
  • Master thesis: Schreiner, C.: Efficient Algorithms for Large Prime Characteristic Fields on Embedded devices
  • Master thesis: Wagner, A.: Hash-based digital signature schemes
  • Master thesis: Hamidi, A.: A guide for the automotive industry to master the transition to the PQC era
  • Master thesis: Müller, L.: Lightweight cryptography for an open RISC-V architecture
  • Master thesis: Knoll, T.: Verifiable delay functions in hardware
  • Master thesis: Müller, M.: Fast implementation of the CSIDH algorithm using a domain specific language