Springe direkt zu Inhalt

Offene Master-Arbeiten

Exploring the attacks on an existing PQC-scheme

Niklas Julius Müller, available immediately

Quantum computers have the ability to efficiently decode current cryptographic schemes like RSA within polynomial time. To establish secure communication even when Quantum Computers exists the National Institute of Standards and Technology (NIST) started a competition to find a Post-Quantum-Cryptography (PQC) standard that could be used around the world. The aim of this work is to understand a proposed scheme and (a) corresponding attack(s). This work can be focused either on the cryptographic scheme or the attack(s). The focus and expectations will be discussed individually depending on the student. The overall goal of this work is to shed light on the needed security of PQC-schemes and different attack vectors for such systems.

Requirements

HSP for the dihedral Group

Niklas Julius Müller, available immediately

The Hidden Supgroup Problem (HSP) searches for a Group H “hidden” by a function f, i.e., f(x) = f(x+h) for all h \in H. The algorithm of Shor solves this problem on a quantum computer for finite abelian groups and \Z. For modern cryptographic systems the non-abelian dihedral Group is of particular interest due to its connection to lattice problems. G. Kuperberg devised a subexponential-time quantum algorithm for the dihedral hidden subgroup problem and improved it. The aim of this thesis would be to understand both algorithms and make them understandable.

Requirements

Exploring the Relationship Between the Fourier Spectrum of Boolean Functions and Their Algebraic Normal Form (ANF) in quantum setting

Cezary Pilaszewicz, available immediately

Quantum computers have the ability to efficiently encode the Fourier Spectrum of a Boolean function in superposition, enabling the identification of strong linear approximations within polynomial time. Each approximation is weighted by its fitness, increasing the likelihood of measuring optimal results. This thesis will explore the relationship between the distribution of the Fourier Spectrum and the Algebraic Normal Form (ANF) of Boolean functions, with a focus on understanding how these properties influence the learnability of such functions. The core question addressed will be whether functions that are well-approximated using quantum algorithms can also be effectively approximated using classical computing methods. Through this investigation, the study aims to shed light on the comparative strengths of quantum and classical approaches in Boolean function approximation.

Requirements

An Analysis of the Vulnerability of Quantum Key Distribution (QKD) Implementation Schemes to Man-in-the-Middle (MitM) Attacks

Cezary Pilaszewicz, available immediately

Quantum Key Distribution (QKD) is an emerging field that leverages the principles of quantum mechanics to ensure secure communication, offering unique guarantees based on the physical properties of quantum systems. However, the primary focus of QKD development has been on addressing physical limitations, often leaving potential vulnerabilities, such as man-in-the-middle (MitM) attacks, underexplored.

This thesis aims to examine the resilience of various QKD implementation schemes against MitM attacks. By analyzing specific QKD implementations, such as "Quantum encryption in phase space with displacement operators" by Randy Kuang & Adrian Chan, the study will assess the mechanisms employed to prevent these attacks. The outcome will provide a comprehensive analysis of different QKD schemes and a clear rationale for the inapplicability of MitM attacks in certain implementations. This research will contribute to a deeper understanding of the security measures necessary for robust QKD systems.

Requirements

Creation of privacy icons or alternative simplifications for a more comprehensible data protection policy

Sandra Kostic, available immediately

Privacy policy and cookie settings are content that a user has to deal with almost every day while browsing. The problem is that these privacy policies are often very long and also difficult to understand. The motivation now is to make this privacy policy more understandable and clearer, in order to get an impression of the content at a glance.

 The goal of the thesis is to develop privacy icons or alternative simplifications to summarize privacy policies. These elements should not only be developed, but also evaluated in terms of their comprehensibility and user-friendliness.

The thesis can be written in German or English.

Requirements

Basic knowledge of usability, usable security and UI/UX design. In the best case, a finished module in the context of Human Centered Computing or Usable Security can already be proven.

Quantitative survey on digital identities and wallets

Sandra Kostic, available immediately

Digital identities are used to identify oneself online. In order to be able to identify oneself with different identification documents, it is possible to use so-called identity wallets. They allow the user alone to decide which data is sent to which provider for the purpose of identification. Since personal data is handled in this case, it is relevant for the acceptance of such solutions that the user also trusts the application.

 The goal of this thesis is to develop a survey questionnaire to collect requirements for digital identities as well as wallets. The focus will be on factors that strengthen trust in such solutions. What factors are there and how can they be prioritized?

The thesis can be written in German or English.

Requirements

Basic knowledge of usability, usable security and UI/UX design. In the best case, a finished module in the context of Human Centered Computing or Usable Security can already be proven