Search

Frequently Searched Pages

Deutsch

Accessibility

Zahl 30 als Symbol für das Namensjubiläum der Bauhaus-Universität Weimar

Courses – Overview

CourseInformation
Diskrete StrukturenCompulsory (Bachelor), every 2 semesters
Introduction to Modern Cryptography

Compulsory (Bachelor), Elective (Master), 

every 2 semesters

Quantum Algorithms & Cryptanalysis,

Secure Channels,

Cryptographic Hash Functions,

Security Engineering

Elective (Bachelor & Master), 

alternating each semester

Seminar

Elective (Bachelor & Master), 

every semester

Security Project

Elective (Bachelor & Master), 

every semester

Courses

Diskrete Strukturen Less More

This module aims to equip students with the key fundamentals and methods that are essential for studies in Computer Science. Students are introduced to sub-fields of mathematics that are particularly important for Computer Science, and are taught the concepts and methods of algorithmics. 

For example, properties of discrete sets such as the natural numbers or integers are covered and derived using proofs. Furthermore, students learn to apply elementary methods of proof, to abstract problems and to represent them algorithmically. 

Note that this module is held in German and is only available for Bachelor's students.

Introduction to Modern Cryptography Less More

Cryptography is a sub-field of theoretical Computer Science. This course covers distributed systems that attempt to communicate with one another in the presence of adversaries or attackers. The course focuses on fundamental security properties such as confidentiality, authenticity and non-repudiation, as well as theoretical and practical attacks on communicating systems.

This module covers the fundamentals of well-known and secure cryptographic algorithms, whilst also analysing insecure algorithms, which provide insight and intuition into cryptographic design mechanisms. Through proofs, assumptions are made regarding the security of abstracted systems, which form the basis for implementing these systems securely and correctly in practice.

This module is a prerequisite for a number of advanced courses, such as the lectures on »Secure Channels« and »Cryptographic Hash Functions«, as well as seminars and certain projects.

Quantum Algorithms & Cryptanalysis Less More

A quantum computer is a technology of the near future that makes use of certain effects of quantum physics. There are only a few hundred of these devices – which are still very much at the experimental stage, not particularly useful and extremely expensive – in the whole world. However, even without access to such machines or much knowledge of physics, one can use linear algebra to understand how a quantum computer works and what its advantages and disadvantages are compared to our »classical« computers. In this lecture, students will learn about the model of quantum computing, well-known quantum algorithms and their implications for modern cryptography.

Secure Channels Less More

In cryptography, a »secure channel« is a protocol that enables secure communication, such that the confidentiality and authenticity of the communication are verifiably guaranteed, even if an attacker actively attempts to breach it or obtain information about its contents. In cryptography, the term »authenticated encryption« is used, which can follow different designs depending on the context. In this lecture, students will learn how to analyse these cryptographic systems, which well-known algorithms exist and how they work, and will examine examples of insecure systems and how to attack them.

Prerequisite: »Introduction to Modern Cryptography« (or an equivalent course at another university).

Cryptographic Hash Functions Less More

‘Hash functions’ are not only important algorithms across the entire field of Computer Science; those belonging to the subset of »cryptographic hash functions« are often described as the workhorses of cryptography. They feature as components in almost all well-known and widely used security protocols (e.g. »SSH«, »TLS«, »RSA-OAEP«). Following the discovery of efficient attacks on early hash functions such as »MD5« or »SHA-1«, the »SHA-2« and »SHA-3« families of functions appear to remain secure. One of the finalists in the NIST standardisation process, which ultimately led to the development of SHA-3, originated here at the chair of Information Security & Cryptography in Weimar. In this lecture, the various relevant hash functions and their use cases will be presented; their security properties will be analysed, and attacks on insecure systems will be examined.

Prerequisite: »Introduction to Modern Cryptography« (or an equivalent course at another university).

Security Engineering Less More

The development of secure and reliable systems presents a major challenge for both system architects and software developers. Due to growing awareness amongst politicians and in the media, IT security is becoming an increasingly important aspect of the IT sector. This lecture offers an introduction to the »Ada’05« programming language, which is considered particularly well-suited to the implementation of secure and reliable systems. In addition, methods from the field of software engineering will be presented that serve to enhance the security, reliability and maintainability of software systems.

Seminars Less More

Usually, a specialisation seminar on a specific topic in the field of cryptography is offered each semester. At the start of the semester, there is a brief introduction to the main topic and a list of relevant publications (in English) is provided. All students must select one of the publications, on which they will work largely independently throughout the semester. Midway through the semester, there is a compulsory session for a 5-minute presentation, in which the content and contributions of the selected paper are summarised in broad terms. At the end of the semester, the content must then be presented to all participants in a detailed presentation. Great emphasis is placed on independent study and self-organisation; however, consultation sessions can be arranged at the students’ request. 

Prerequisite: »Introduction to Modern Cryptography« (or an equivalent course at another university).

Projects Less More

Each semester, 1–2 projects on a topic within the fields of cryptography or IT security are offered. The topic is worked on in small groups and discussed with the academic staff at weekly meetings. At the end of the project, students usually produce a detailed, joint project report and give a final presentation. The projects, which are worth between 12 and 15 European Credit Transfer System credits depending on the examination regulations, are therefore very extensive, and students are expected to work on them even during the semester break.

The project topics are presented in person at the start of each semester during the Project Fair or can be found in the course catalogue.

Schedule

Lectures Less More
Summer Semester 2026

Introduction to Modern Cryptography

 

Quantum Algorithms and Cryptanalysis

Winter semester 2026

Diskrete Strukturen

 

Advanced Cryptography: Secure Channels

Summer semester 2027

Introduction to Modern Cryptography

 

Cryptographic Hash Functions

Seminars Less More

Seminars

Summer Semester 2026Advanced Cryptography: Committing Security
Winter semester 2026Advanced Cryptography: Authentication & Authenticated Encryption
Projects Less More

Projects

Summer Semester 2026Is WORST the Best? – Optimising Hash-Based Signature Schemes
Winter semester 2026Quantum Computing Curiosity – Understanding and Visualising the Future

Thesis Topics

Post-quantum cryptography Less More

In the mid-1990s, Peter Shor discovered his famous algorithm for factoring large numbers. It soon became apparent that this algorithm could be used to break virtually all public-key cryptosystems currently in practical use. On the positive side, the type of quantum computer required to run Shor’s algorithm is not yet available – but there is an urgent need for new ‘post-quantum’ asymmetric cryptosystems, which will withstand the advent of reliable, large-scale quantum computers.

“Post-quantum security” refers to cryptographic security against an attacker capable of utilising a powerful quantum computer. Currently, no such device exists. However, as technology advances, many algorithms currently in use that are labelled as secure will prove useless against an attacker with access to a sufficiently large quantum computer.

Topics:

Asymmetric post-quantum security

Relatively recently, the ‘National Institute for Standards and Technology (NIST)’, which de facto sets the global standard for the use of cryptography on the internet, announced the winners of the ‘Post-Quantum Cryptography Standardisation Process’, establishing the new standards for asymmetric cryptography, which is intended to replace quantum-vulnerable algorithms such as ‘RSA’. Studying these new algorithms and comparing the candidates for the standardisation process can provide insights into the methods used and how they differ from the current approach:

  • Lattice-based cryptosystems (e.g. ‘Kyber’, ‘Dilithium’, ‘NTRU’),
  • code-based cryptosystems (e.g. ‘McEliece’),
  • hash-based digital signatures (e.g. ‘SPHINCS+’).

     

Symmetric post-quantum security

Whilst just a couple of years ago, most researchers agreed that symmetric cryptography algorithms and schemes were quite secure against the threat of quantum computing, recent research has shown that many of the constructions currently in use are vulnerable to a quantum attacker, albeit in a different way to asymmetric systems. It is important to know which systems are not post-quantum secure, which ones remain secure, and which of the current analysis tools and definitions need to be adapted to the quantum threat model:

  • Quantum security for symmetric encryption,
  • quantum unforgeability for authentication or authenticated encryption,
  • exploration of new cryptographic designs that claim to be quantum-secure.
Decentralised Cryptography Less More

A decentralised system does not rely on a central authority and distributes trust evenly amongst many entities (e.g. its users). Examples include the TOR network, blockchains and the ‘web of trust’.

Topics:

Record Linkage

Record linkage is a crucial step in many database applications. At the same time, record linkage can raise privacy concerns. To what extent is it possible to support record linkage whilst maintaining a well-defined and quantifiable level of privacy for the user?

 

Proofs of Storage

In recent years, the concept of hash-based cryptocurrencies, such as Bitcoin, has taken off. A drawback of Bitcoin is its reliance on cryptographic ‘proofs of work’, which are, in effect, a ‘proof of power consumption’ and CO₂ emissions. We are therefore investigating more environmentally friendly alternatives, such as ‘proofs of storage’.

Implementation & Reverse Engineering Less More

Security algorithms must be implemented carefully and with the utmost care to avoid bugs, exploits, backdoors or other vulnerabilities. This is often easier said than done, and the less restrictive and transparent a programming language or paradigm is, the greater the likelihood of unwanted behaviour in the software.

Topics:

Implementing and Verifying Algorithms in SPARK

SPARK is an Ada-based programming language used for the development of dedicated secure software. SPARK supports the specification and verification of an implementation’s information flow, as well as pre- and post-conditions.  The aim is to implement simple algorithms in SPARK (sorting and searching, arithmetic with large numbers, etc.), and to prove the implementations using the SPARK toolset.

 

A Simulator/Demonstrator for Grover and Other Quantum Algorithms

Quantum algorithms have a reputation for being difficult to grasp. To some extent, this reputation may well be deserved – but not all quantum algorithms are so difficult. The main aim of the thesis is to develop a simplified quantum simulator with a visual interface to implement some simple quantum algorithms, such as Grover’s quantum search algorithm. The simulator will be used to give younger students a first impression of quantum algorithms, for example, as part of the ‘Byte the Bytes’ programme.

 

Evaluation of RUST as a language for secure and reliable software.

RUST is a language that was designed with the development of reliable software in mind. To evaluate RUST, you should use an existing cryptographic library to implement various security protocols. These should be evaluated and compared with implementations in other languages, such as Ada, C and C++.

Cryptosystem Design and Analysis Less More

Designing a cryptographic system or algorithm is neither trivial nor straightforward. A great deal of thought needs to be given to every aspect of the design before it is presented to the scientific community, which examines it critically and attempts to identify vulnerabilities or provide feedback on improvements.

Topics:

Single-Page Cryptography

You have been captured and wrongly imprisoned and need to send an encrypted message to your contact on the outside using an emergency key phrase that you both memorised in case of danger. Fortunately, in your thesis you designed a cryptographic system that fits on just one standard page, making it easy enough to memorise. As you can only send one message, you want to ensure that you have memorised the ‘implementation’ correctly. That is why you have also memorised a simple self-testing procedure, which you can use to check whether your implementation is correct. Now that everything is correct, you can use your Mini-Encryption System to encrypt the message so that it can only be read by your contact on the outside who knows the key phrase.

An example of such a system could be the RC4 stream cipher. Unfortunately, RC4’s security has been partially compromised in the past, and it provides neither a way to encrypt multiple messages using the same key nor does it provide authentication.

 

Easy Attacks – Attacking the AEZ Cryptosystem

AEZ (pronounced “easy”) is a cryptosystem that uses four rounds of the AES as its internal building block. The aim is to describe attacks that occur when this building block is reduced to fewer than four rounds.

 

Leakage-Resilient Symmetric Cryptosystems

In cryptography, “leakage resilience” refers to a cryptosystem’s ability to provide security even when an adversary has access to a side-channel, such as, for example, a power consumption trail resulting from operations using the secret key. The aim is to study symmetric cryptosystems which have been claimed by their designers to be “leakage-resilient”.

 

Analysis of the Duplex and Sponge Modes

The ‘Duplex Mode’ is an increasingly popular construction used in modern symmetric cryptography algorithms. One example is the authenticated encryption mode of the recent ASCON standard for Lightweight Cryptography. You will analyse new variants of the Duplex mode, which, if secure, could offer some practical benefits. You will test the security of these variants, both by potentially identifying attacks and by exploring ideas for security proofs.

Language-based Security Less More

When binary data is sent from one party to another, the encoding of the data can be described as a “data serialisation” language. Many of these languages use the ‘length-prefix’ pattern for strings, containers and other data items of variable length. This consists of an encoding of the item’s length, followed by an encoding of the item itself without closing brackets or ‘end’ symbols.

Length-prefix languages are not context-free. Consequently, the vast array of tools and methods for specifying, analysing and parsing context-free languages appears to be of no use for length-prefix languages. This appears to explain why incorrect specifications of length-prefix languages and buggy hand-written parsers are so often the root cause of security issues and exploits, as, for example, in the case of the famous ‘Heartbleed’ bug.

Topics:

Formal language grammar

Building upon an ‘Extended Backus-Naur Form (EBNF)’ for context-free languages, develop a grammar for our formal language class ‘calc-context-free’ [2].

 

Parser generators

Develop an automatic parser generator or a wrapper for existing parser generators such as YACC, based on an algorithm already established in [2] (including a reference implementation).

 

Formal analysis and proofs

Examine the formal properties of the “calc-regular” [1] and “calc-context-free” languages [2] and investigate whether certain theorems can be decided efficiently (i.e. in polynomial time).

 

References:

[1] Grosch, König, Lucks: “Taming the Length Field in Binary Data” – https://ieeexplore.ieee.org/document/8227292

[2] Jakoby, Leuther, Lucks: “Formal Language Theory for Practical Security” – https://ieeexplore.ieee.org/document/9474290