Master's theses of year 2023
Theses and projects (PhD, MSc, BSc, Project)
-
Automated Full Disk Encryption of Kubernetes Nodes in the context of Health Data Processing.
1
2023.
BibTeX Entry
@misc{kuss23, author = {Sebastian Kussl}, title = {{Automated} {Full} {Disk} {Encryption} of {Kubernetes} {Nodes} in the context of {Health} {Data} {Processing}}, year = {2023}, key = {kuss23}, month = {1}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Sophia Grundner-Culemann and Zinterhof}, type = {Masterthesis}, } -
Security Metrics for Strong PUFs based on Effective 2D Visualization.
2
2023.
BibTeX Entry
@misc{lerc23, author = {Laurence Lerch}, title = {{Security} {Metrics} for {Strong} {PUFs} based on {Effective} 2D {Visualization}}, year = {2023}, key = {lerc23}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Ulrich Rührmair}, type = {Masterthesis}, } -
Implementierung und Evaluierung einer Protokoll Diversifikation für Moving Target Defense.
2
2023.
BibTeX Entry
@misc{boet23, author = {Vanessa Bötnagel}, title = {{Implementierung} und {Evaluierung} einer {Protokoll} {Diversifikation} für {Moving} {Target} {Defense}}, year = {2023}, key = {boet23}, month = {2}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Nils Rodday}, type = {Masterthesis}, } -
Certificateless DTLS in Wireless Sensor Networks.
3
2023.
BibTeX Entry
@misc{edmo23, author = {Kevin Owen Edmonds}, title = {{Certificateless} {DTLS} in {Wireless} {Sensor} {Networks}}, year = {2023}, key = {edmo23}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Masterthesis}, } -
Collaborative Exploration of Code Structure in VR Software Cities.
3
2023.
BibTeX Entry
@misc{fran23, author = {Christian Frank}, title = {{Collaborative} {Exploration} of {Code} {Structure} in {VR} {Software} {Cities}}, year = {2023}, key = {fran23}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Markus Wiedemann}, type = {Masterthesis}, } -
Enabling HPC in the Cloud by leveraging a Containerized Microservice-Architecture.
3
2023.
BibTeX Entry
@misc{floe23, author = {Florian Flöter}, title = {{Enabling} {HPC} in the {Cloud} by leveraging a {Containerized} {Microservice-Architecture}}, year = {2023}, key = {floe23}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Maximilian Höb}, type = {Masterthesis}, } -
Quantum Computing Simulation using Posit Numbers.
3
2023.
BibTeX Entry
@misc{edel23, author = {Florian Edelmann}, title = {{Quantum} {Computing} {Simulation} using {Posit} {Numbers}}, year = {2023}, key = {edel23}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Pascal Jungblut}, type = {Masterthesis}, } -
Advanced Security Metrics for Strong PUFs.
4
2023.
BibTeX Entry
@misc{tong23, author = {Shaohua Tong}, title = {{Advanced} {Security} {Metrics} for {Strong} {PUFs}}, year = {2023}, key = {tong23}, month = {4}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Ulrich Rührmair}, type = {Masterthesis}, } -
Attack Replay Framework: Automatisierte Verifikation bekannter Schwachstellen durch detektierte Angriffsversuche.
7
2023.
BibTeX Entry
@misc{sedl23, author = {S S}, title = {{Attack} {Replay} {Framework:} {Automatisierte} {Verifikation} bekannter {Schwachstellen} durch detektierte {Angriffsversuche}}, year = {2023}, key = {sedl23}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Daniel Weber}, type = {Masterthesis}, } -
Android Platform for Applying Image Transformations to Optical PUFs.
7
2023.
BibTeX Entry
@misc{heyd23, author = {Yu Heydemann}, title = {{Android} {Platform} for {Applying} {Image} {Transformations} to {Optical} {PUFs}}, year = {2023}, key = {heyd23}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Ulrich Rührmair}, type = {Masterthesis}, } -
Improving a practical course about Network- and Storage-Virtualization in higher education teaching.
8
2023.
BibTeX Entry
@misc{stab23, author = {Georg Staber}, title = {{Improving} a practical course about {Network-} and {Storage-Virtualization} in higher education teaching}, year = {2023}, key = {stab23}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Lindinger}, type = {Masterthesis}, } -
Application Fingerprinting using eBPF.
8
2023.
BibTeX Entry
@misc{szos23, author = {Michael Szostak}, title = {{Application} {Fingerprinting} using {eBPF}}, year = {2023}, key = {szos23}, month = {8}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Karl Fuerlinger}, type = {Masterthesis}, } -
Evaluation of Cloud Native Storage technologies for Kubernetes.
11
2023.
BibTeX Entry
@misc{colb23, author = {Raphael Colberg}, title = {{Evaluation} of {Cloud} {Native} {Storage} technologies for {Kubernetes}}, year = {2023}, key = {colb23}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Stefan Metzger}, type = {Masterthesis}, } -
Efficient Parallel Quantum Circuit Optimization using the ZX Calculus.
10
2023.
Abstract
Through the quantum effects of the so-called 'qubit', quantum computers are potentially able to solve a larger problem class than classical computers in polynomial time, called bounded-error quantum polynomial time (BQP). However, the practicality of scaling quantum computers to tackle larger problems comes with formidable challenges – increased costs, reduced accuracy, as well as longer design and construction times. These challenges can render a quantum computing design infeasible, emphasizing the critical need to ensure quantum circuits are only as large as they are required to be. In order to reduce the size of the circuit, various optimization techniques can be employed. Current quantum circuit optimization algorithms transform circuits into a more general representation in the ZX-calculus, perform various simplification operations on it, and then extract a reduced, but equivalent quantum circuit. Out of these, the simplification and extraction require the greatest amount of time, potentially even outclassing the computational class of BQP. Our research explores methods to parallelize the quantum circuit extraction process, rendering it suitable for high-performance systems. We present our implementation of a parallelized quantum circuit extraction algorithm, alongside surprising findings that have emerged during our work and evaluation, offering avenues for further investigation and refinement.BibTeX Entry
@misc{quan23, author = {Marcel Quanz}, title = {{Efficient} {Parallel} {Quantum} {Circuit} {Optimization} using the {ZX} {Calculus}}, year = {2023}, abstract = {Through the quantum effects of the so-called `qubit', quantum computers are potentially able to solve a larger problem class than classical computers in polynomial time, called bounded-error quantum polynomial time (BQP). However, the practicality of scaling quantum computers to tackle larger problems comes with formidable challenges – increased costs, reduced accuracy, as well as longer design and construction times. These challenges can render a quantum computing design infeasible, emphasizing the critical need to ensure quantum circuits are only as large as they are required to be. In order to reduce the size of the circuit, various optimization techniques can be employed. Current quantum circuit optimization algorithms transform circuits into a more general representation in the ZX-calculus, perform various simplification operations on it, and then extract a reduced, but equivalent quantum circuit. Out of these, the simplification and extraction require the greatest amount of time, potentially even outclassing the computational class of BQP. Our research explores methods to parallelize the quantum circuit extraction process, rendering it suitable for high-performance systems. We present our implementation of a parallelized quantum circuit extraction algorithm, alongside surprising findings that have emerged during our work and evaluation, offering avenues for further investigation and refinement.}, key = {quan23}, month = {10}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Karl Fuerlinger and Korbinian Staudacher}, type = {Masterthesis}, } -
Analyzing word predictions by quantum natural language processing.
7
2023.
PDF
Abstract
Quantum natural language processing is an emerging field, that combines principles of quantum computing with natural language processing with the aim to enhance the capa- bilities to process and analyze human language. In classical natural language processing, word prediction is an ingredient of the pretraining task for large language models. This forms the motivation behind the exploration of a word prediction task in QNLP. This thesis deals with the implementation of a word prediction task in quantum nat- ural language processing using a mathematical framework, particularly the DisCoCat framework. Firstly, we reformulate word prediction as a binary classification task and train quantum machine learning models on that task. Secondly, we implement a word prediction task as a multiclass classification and also train models on that. In the course of this implementation, we give a comprehensive explanation of how to design a mul- ticlass classification in the DisCoCat framework. Afterwards, we show how masking can be conceptualized inside a quantum computing environment. Then, a strategy is presented, which reduces the number of qubits and lowers the task complexity. This strategy has the potential to be extended beyond word prediction and to be applied to various other problems as well. The evaluation of the models which have been trained with the binary classification task shows promising results. The masking approach and the strategy for reducing the number of qubits were both a success in the evaluation. However, the evaluation of the models trained on the multiclass classification approach is not of the same standard as the binary approach. The reasons for that outcome are discussed in depth. For both tasks, we document the applied hyperparameters. Further research topics include the continued development of multiclass classification in the DisCoCat framework and re- search on new ansätze in quantum machine learning.BibTeX Entry
@misc{mura23, author = {Jakob Murauer}, title = {{Analyzing} word predictions by quantum natural language processing}, year = {2023}, pdf = {https://bib.nm.ifi.lmu.de/pdf/mura23.pdf}, abstract = {Quantum natural language processing is an emerging field, that combines principles of quantum computing with natural language processing with the aim to enhance the capa- bilities to process and analyze human language. In classical natural language processing, word prediction is an ingredient of the pretraining task for large language models. This forms the motivation behind the exploration of a word prediction task in QNLP. This thesis deals with the implementation of a word prediction task in quantum nat- ural language processing using a mathematical framework, particularly the DisCoCat framework. Firstly, we reformulate word prediction as a binary classification task and train quantum machine learning models on that task. Secondly, we implement a word prediction task as a multiclass classification and also train models on that. In the course of this implementation, we give a comprehensive explanation of how to design a mul- ticlass classification in the DisCoCat framework. Afterwards, we show how masking can be conceptualized inside a quantum computing environment. Then, a strategy is presented, which reduces the number of qubits and lowers the task complexity. This strategy has the potential to be extended beyond word prediction and to be applied to various other problems as well. The evaluation of the models which have been trained with the binary classification task shows promising results. The masking approach and the strategy for reducing the number of qubits were both a success in the evaluation. However, the evaluation of the models trained on the multiclass classification approach is not of the same standard as the binary approach. The reasons for that outcome are discussed in depth. For both tasks, we document the applied hyperparameters. Further research topics include the continued development of multiclass classification in the DisCoCat framework and re- search on new ansätze in quantum machine learning.}, key = {mura23}, month = {7}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Korbinian Staudacher and Wolfgang Gehrke (UniBw)}, type = {Masterthesis}, } -
Exploring the Potential of Filtering Variational Quantum Eigensolvers for Job Scheduling.
11
2023.
PDF
Abstract
Job scheduling is a complex optimization problem with multiple variables, constraints, and goals. Solving such problems using classical computing can be challenging, since they are NP-complete and real-world instances can be quite large. Quantum computing is a promising solution, as it is theoretically faster than classical computing for certain types of problems. In this thesis, we use the filtering variational quantum eigensolver (F-VQE), a parameter- ized quantum algorithm, to solve a simplified real-world scheduling problem. The F-VQE algorithm optimizes solutions by filtering out unpromising ones and using a classical op- timization routine to refine the remaining solutions. Although the F-VQE algorithm is based on a paper by Amaro et al., it has not yet been fully evaluated for solving scheduling problems. While VQEs have been successful in solving combinatorial optimiza- tion problems, we seek to assess the performance of F-VQE in solving scheduling problems. We have two objectives in this research: firstly, to enhance and analyze the F-VQE al- gorithm, and secondly, to evaluate the potential of quantum computing in solving complex scheduling problems. To accomplish this, we will compare the performance of the F-VQE algorithm with other quantum and classical approaches for solving real-world scheduling problems. This will provide valuable insights into the effectiveness of quantum comput- ing for solving these problems, as well as identify potential improvements to the F-VQE algorithm. We delve deeper into the F-VQE algorithm to identify potential areas for improvement. We will examine various ansatz designs, different filtering strategies, and encoding techniques. Worthwhile additions are implemented and tested against. To compare the F-VQE algorithm’s performance with other variational quantum algo- rithms and an approach using Grover’s algorithm, which is already implemented by the DLR. We evaluate the efficiency, scalability, and quality of solutions provided by each algo- rithm and discuss the potential benefits and drawbacks of the F-VQE for solving real-world scheduling problems.BibTeX Entry
@misc{sajk23, author = {Wanja Sajko}, title = {{Exploring} the {Potential} of {Filtering} {Variational} {Quantum} {Eigensolvers} for {Job} {Scheduling}}, year = {2023}, pdf = {https://bib.nm.ifi.lmu.de/pdf/sajk23.pdf}, abstract = {Job scheduling is a complex optimization problem with multiple variables, constraints, and goals. Solving such problems using classical computing can be challenging, since they are NP-complete and real-world instances can be quite large. Quantum computing is a promising solution, as it is theoretically faster than classical computing for certain types of problems. In this thesis, we use the filtering variational quantum eigensolver (F-VQE), a parameter- ized quantum algorithm, to solve a simplified real-world scheduling problem. The F-VQE algorithm optimizes solutions by filtering out unpromising ones and using a classical op- timization routine to refine the remaining solutions. Although the F-VQE algorithm is based on a paper by Amaro et al., it has not yet been fully evaluated for solving scheduling problems. While VQEs have been successful in solving combinatorial optimiza- tion problems, we seek to assess the performance of F-VQE in solving scheduling problems. We have two objectives in this research: firstly, to enhance and analyze the F-VQE al- gorithm, and secondly, to evaluate the potential of quantum computing in solving complex scheduling problems. To accomplish this, we will compare the performance of the F-VQE algorithm with other quantum and classical approaches for solving real-world scheduling problems. This will provide valuable insights into the effectiveness of quantum comput- ing for solving these problems, as well as identify potential improvements to the F-VQE algorithm. We delve deeper into the F-VQE algorithm to identify potential areas for improvement. We will examine various ansatz designs, different filtering strategies, and encoding techniques. Worthwhile additions are implemented and tested against. To compare the F-VQE algorithm’s performance with other variational quantum algo- rithms and an approach using Grover’s algorithm, which is already implemented by the DLR. We evaluate the efficiency, scalability, and quality of solutions provided by each algo- rithm and discuss the potential benefits and drawbacks of the F-VQE for solving real-world scheduling problems.}, key = {sajk23}, month = {11}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Korbinian Staudacher and Xiao-Ting Michelle To}, type = {Masterthesis}, } -
Benchmarking of Quantum Generative AI Models.
12
2023.
BibTeX Entry
@misc{mars23, author = {Marousa Marso}, title = {{Benchmarking} of {Quantum} {Generative} {AI} {Models}}, year = {2023}, key = {mars23}, month = {12}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Andre Luckow}, type = {Masterthesis}, } -
Entwurf und Entwicklung eines Moduls zur Dynamischen Umlaufplanung des urbanen Luftverkehrs unter Kapazitätseinschränkungen.
12
2023.
BibTeX Entry
@misc{moos23, author = {Johannes Moosburger}, title = {{Entwurf} und {Entwicklung} eines {Moduls} zur {Dynamischen} {Umlaufplanung} des urbanen {Luftverkehrs} unter {Kapazitätseinschränkungen}}, year = {2023}, key = {moos23}, month = {12}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Corinna Schmitt}, type = {Masterthesis}, } -
Towards efficient Revocable Identity-based Signatures on Lattice Problems.
3
2023.
PDF
Abstract
Identity-based Signatures are an important technique for light-weight authentication. A downside of this signature scheme is that when a key is revoked, all signing keys in the entire system have to be reissued by one central authority. There exists some approaches to reducing the effort of reissuing these user keys, among those a method of delegating this computationally expensive task from the central authority to each user. This scheme is called Key Updatable Signature Scheme and was designed and implemented for elliptic curve signatures and will not remain secure in the future quantum age. Lattice-based cryptography is a promising candidate for future IBS schemes due to its worst-case hardness assumption, efficient implementation and so-far quantum resistance. This thesis provides an introduction to lattice-based cryptography, presenting the mechanisms of various cryptographic primitives. Based on this, the requirements for constructing a KUSS from an elliptic curve IBS scheme are analysed and compared with an existing lattice-based IBS scheme. Although no solution for a fully functional lattice-based IBS is found, a candidate KUSS is sketched and the requirements that remain to be met and proven are concluded.BibTeX Entry
@misc{muni23, author = {Emma Munisamy}, title = {{Towards} efficient {Revocable} {Identity-based} {Signatures} on {Lattice} {Problems}}, year = {2023}, pdf = {https://bib.nm.ifi.lmu.de/pdf/muni23.pdf}, abstract = {Identity-based Signatures are an important technique for light-weight authentication. A downside of this signature scheme is that when a key is revoked, all signing keys in the entire system have to be reissued by one central authority. There exists some approaches to reducing the effort of reissuing these user keys, among those a method of delegating this computationally expensive task from the central authority to each user. This scheme is called Key Updatable Signature Scheme and was designed and implemented for elliptic curve signatures and will not remain secure in the future quantum age. Lattice-based cryptography is a promising candidate for future IBS schemes due to its worst-case hardness assumption, efficient implementation and so-far quantum resistance. This thesis provides an introduction to lattice-based cryptography, presenting the mechanisms of various cryptographic primitives. Based on this, the requirements for constructing a KUSS from an elliptic curve IBS scheme are analysed and compared with an existing lattice-based IBS scheme. Although no solution for a fully functional lattice-based IBS is found, a candidate KUSS is sketched and the requirements that remain to be met and proven are concluded.}, key = {muni23}, month = {3}, school = {Ludwig-Maximilians-Universität München}, supervisors = {Tobias Guggemos and Sophia Grundner-Culemann}, type = {Masterthesis}, }
Disclaimer:
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.