Offered Theses

Please contact the doctoral researchers directly if you are interested in a Bachelor or Master thesis, a student job, an "Ingenieurspraxis" or a "Forschungspraxis". It is also usually possible to find a topic that matches your specific interests. Please include a curriculum vitae together with a list of attended courses when applying for a thesis. If your "Ingenieurspraxis" is selected to be supervised by one of our professors, please hand in the documents to Doris Dorn (Room N2401).

Bachelor's Theses

[identification] Pseudo-Random Identification

Keywords:
random pseudo identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

One advantage can be gained by using pseudo randomness to generate both the input and the code itself.
Your task will be implementing the identification codes described in the attached pdf (an english translation of a paper published in russian in a russian journal) aiming at the fastest implementation and smallest collisions, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI from TUM and CeTI from TU Dresden, the latter having already some preliminary implementation of pseudo-random identification using various pseudo-random generators. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

Error Correcting and Masking Codes for Memories with (Partially) Defects

Keywords:
Linear Codes, Algebraic Codes, Error Correction , Masking Defects, Flash Memories, Phase-Change Memories

Description

For different applications, the demand for reliable memory solutions in particular for non-volatile memories such as phase-change memories (PCMs)  is rapidly increasing. PCM cells may become defective (also called stuck) either fully or partially if they fail in switching their states, and therefore these cells can only hold a single phase. In response to these defects, combined masking and error-correcting code constructions have been proposed, where masking is for hiding the defects while error-correcting is to compromise potential added-channel errors.  We want to investigate further code constructions such that less overall redundancy is required to handle these two types of errors. As an alternate, work for combined erasure errors and masking code constructions could be investigated.

Prerequisites

- Basic principle of Linear Algebra 

- Channel Coding/Coding Theory 

- Basic knowledge in Information Theory  

Contact

M.Eng. Haider Al Kim

Doctoral Researcher

Technical University of Munich

Department of Electrical and Computer Engineering /

Coding and Cryptography (COD) Group

 

Email: haider.alkim@tum.de 

 

Supervisor:

Deterministic K-Identification For The DMC With Power Constraint

Keywords:
Identification via channel, K-identification, deterministic codes
Short Description:
K-identification capacity of a DMC is derived.

Description

The student attempt to study the deterministic identification capacity

of a DMC subject to power constraint and generalize it for the K-identification.

Prerequisites

Basics of Information Theory and Channel Coding.

Familiarity with the fundamentals of Identification Theory

Supervisor:

Mohammad Salariseddigh

[identification] Implementation of identification with universal hash functions

Keywords:
universal hash identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing the identification codes described in

aiming at the fastest implementation, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

Error Correction for DNA-Based Data Storage

Description

DNA-based data storage is a novel approach for long term digital data archiving.

Due to the unique nature of writing and reading DNA, the channel associated with these processes is still realtively poor understood and varies over different  synthesis (writing) and sequencing (reading) technologies. The task of the student is to analyze different sequencing methods and the associated errors and formulate associated channel models. Based on these models, error-correcting schemes shall be evaluated.

Prerequisites

- Basic principles of stochastic and algebra
- Channel Coding
- Information Theory

Supervisor:

Master's Theses

[identification] Pseudo-Random Identification

Keywords:
random pseudo identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

One advantage can be gained by using pseudo randomness to generate both the input and the code itself.
Your task will be implementing the identification codes described in the attached pdf (an english translation of a paper published in russian in a russian journal) aiming at the fastest implementation and smallest collisions, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI from TUM and CeTI from TU Dresden, the latter having already some preliminary implementation of pseudo-random identification using various pseudo-random generators. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[quantum] Quantum Machine Learning for Communication

Keywords:
physical, layer, quantum, machine learning, non-linear

Description

As part of an ongoing project with Huawei we are looking into quantum machine learning algorithms applied to decoding at the end of an optical fiber in the non-linear regime.

So far we have tried only the quantum version of k-mean clustering, however the goal is to test further quantum algorithms, in particular quantum support vector machines next, and their classical quantum-inspired counterpart.

The projects will involve reading the literature on quantum machine learning algorithms and quantum-inspired algorithms, find or come up with an implementation (this will involve the use of quantum libraries, in particular so far we have use qiskit), and benchmark the performance.

Prerequisites

Knowledge of quantum mechanics or quantum information is highly recommended.

Supervisor:

Successive Cancellation Inactivation Decoding over q-ary Erasure Channels

Description

The student is expected to understand a recent decoding algorithm called successive cancellation inactivation (SCI) decoding [1] and extend it towards q-ary erasure channels.

 

[1] https://ieeexplore.ieee.org/abstract/document/9174226

Prerequisites

The student is expected to have a good understanding of linear algebra and be able to implement via Matlab or Julia. The following courses are beneficial:

- Information Theory

- Channel Coding

- Channel Codes for Iterative Decoding

Contact

mustafa.coskun@tum.de

Supervisor:

Mustafa Coskun

Information freshness in next-generation IoT networks

Description

See the attached document, i.e., click on "Diese Seite als PDF öffnen".

Contact

andrea.munari@dlr.de

Supervisor:

Mustafa Coskun - Dr. Andrea Munari (German Aerospace Center (DLR))

Error Correcting and Masking Codes for Memories with (Partially) Defects

Keywords:
Linear Codes, Algebraic Codes, Error Correction , Masking Defects, Flash Memories, Phase-Change Memories

Description

For different applications, the demand for reliable memory solutions in particular for non-volatile memories such as phase-change memories (PCMs)  is rapidly increasing. PCM cells may become defective (also called stuck) either fully or partially if they fail in switching their states, and therefore these cells can only hold a single phase. In response to these defects, combined masking and error-correcting code constructions have been proposed, where masking is for hiding the defects while error-correcting is to compromise potential added-channel errors.  We want to investigate further code constructions such that less overall redundancy is required to handle these two types of errors. As an alternate, work for combined erasure errors and masking code constructions could be investigated.

Prerequisites

- Basic principle of Linear Algebra 

- Channel Coding/Coding Theory 

- Basic knowledge in Information Theory  

Contact

M.Eng. Haider Al Kim

Doctoral Researcher

Technical University of Munich

Department of Electrical and Computer Engineering /

Coding and Cryptography (COD) Group

 

Email: haider.alkim@tum.de 

 

Supervisor:

Automotive ECU - Crypto u. Security

Keywords:
external master thesis, automotive, crypto and security

Description

Dear students,

there is the possibility to conduct your master thesis in cooperation with the Filgis engineering office. I would be your supervisor from the university side. Below you can find an introduction to the company and a description of the offered topic written by Mr. Filgis. In case you are interested in the topic please do not hesitate to contact me or Mr. Filgis via email.

Yours sincerely,
Georg Maringer

Contact data of Mr. Filgis:
simon@ingenieurbuero-filgis.de +49 160 751 403 1

Description:

Founded in April 2021, the Filgis engineering office is a young company. The focus is on embedded development of all kinds. Be it hardware, be it software, be it FPGA. The aim is to advise customers optimally and to help them achieve success with exceptional speed and quality.

Are you a student having experience in the embedded field? Would you like to work on a challenge in the automotive crypto / security area? Your appearance is professional and you work independently and efficiently even under pressure? Do you appreciate an above-average remuneration? Does the field of business consulting sound interesting to you?

With the development of autonomous and connected vehicles in mind the automotive industry is shifting towards strictly encrypting communications between ECUs in the car. To be able to test the DUT ECU in the production line the ECU/OEM specific rules of encryption need to be addressed.
There will be a huge amount of production lines having the need of encryption in future. We developed a low cost embedded system universal solution for all kinds of ECUs. This embedded
system shall be made ready for encryption.
? Internet research on the state of the industry (Vector, AutoSAR ...)
? Working out the requirements regarding automotive crypto / security
? Discussions with all stakeholders of the pilot project
? Planning the architecture for embedded (C, POSIX)
? Implementation and testing
? Performance review

I look forward to your convincing application!
Simon Filgis

Contact

simon@ingenieurbuero-filgis.de

+49 160 751 403 1

Supervisor:

Georg Maringer - Simon Filgis (Ingenieursbüro Filgis)

[identification] Implementation of identification with algebraic-geometry (Goppa) codes

Keywords:
goppa algebraic geometry codes identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing identification with Goppa codes, aiming at the fastest implementation, and testing their performance in comparison to other current implementations. The reference articles for this implementation are:

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Implementation of identification with universal hash functions

Keywords:
universal hash identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing the identification codes described in

aiming at the fastest implementation, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Implementation of identification with Polar codes

Keywords:
polar codes identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing identification with polar codes, aiming at the fastest implementation, and testing their performance in comperison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Applications of Identification Codes in V2X Communications

Keywords:
sumo, ns3, ns-3, vehicular, communication, identification, c++, Reed-Muller

Description

As part of the NewCom Project, new communication paradigms are investigated from an experimental perspective in order to construct proof-of-concept implementations that demonstrate the theoretical results obtained for Post-Shannon Communication schemes. In particular, this MSc thesis focuses on Identification Codes and their integration into a simulation environment where vehicular networks are modelled.

For this, the master student will first conduct a review of the state-of-the-art use cases for identification in the scientific literature and in form of patents, with an emphasis on V2X communications. By using an open-source V2X implementation based on LDR’s Simulation of Urban Mobility (SUMO) framework integrated with ns-3’s implementation of the ITS-G5 and LTE standards and conducting simulation in specific scenarios, the student will gain a first impression of the performance of the system using traditional transmission schemes. The integration of existing implementation of identification codes culminates this thesis, where KPIs will be defined in order to compare the advantages of using identification instead of transmission in the context of V2X communications.

Details about the C++ tools/libraries

The software used for the simulation of the vehicular network communication is ezCar2x

which build on and integrates the NS-3 (network simulation) and SUMO (traffic simulation) libraries

For the identification part and identification code based on Reed-Muller codes needs to be reimplemented (work in progress) from Python into C++ using the Givaro library

 

 

Prerequisites

  • Knowledge of communications engineering, mobile communications, wireless channel models, signal processing, and channel coding techniques (experience in LTE/5G cellular networks is a plus)

  • Interest in novel communication concepts as well in their practical implementation

  • Software experience: MATLAB, C++ and Python (experience with ns-3 or SUMO is a plus)

  • Comfortable working with Linux operative systems and distributed version control tools (e.g., gitlab)

  • Goal-oriented and structured work style

 

Contact

To apply, Please send your application by e-mail to Roberto Ferrara (roberto.ferrara@tum.de) and Luis Torres-Figueroa (luis.torres.figueroa@tum.de) with the following documents:

  • Curriculum vitae

  • Academic transcript

  • Short motivation (0.5 – 1 page)

Supervisor:

[identification] Simulation and performance improvement of identification codes

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be speeding up the current implementations based on Reed-Solomon and Reed-Muller codes:

The coding will be in Python/Sagemath.
This work can accomodate multiple students.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Prerequisites

Nachrichtentechnik 2

 

Supervisor:

[security] Practical implementation of physical-layer semantic security

Keywords:
semantic, security, secrecy, programming, implementation

Description

The goal of this project is to implement in Python/Sagemath the security functions (at least one of four) described in https://arxiv.org/abs/2102.00983
Sagemath contains libraries for mosaics, BIBDs, etc, that can be used for the project.

Motivation:
There are various types of security definitions.
The mutual information based types, in increasing order of security requirement are

  1. Weak secresy asks that the average mutual information of the eavesdropper I(M:E)/n goes to 0 for a uniform message M (average here means averaged over the blocklength n, an additional average over M is implicit in the mutual information)
  2. Strong secrecy asks that the total mutual information I(M:E) goes to 0,
  3. Semantic security asks that the total mutual informaiton I(M:E) goes to 0 for any distribution of the message M (and thus in particular for all distributions that pick any of two chosen messages with 1/2 probabilty)

Then there are the almost-equivalent respective indistiguishablity types  of security requirements (below |P-Q|_1 is the statistical distance and Exp_M is expectation value over M)

  1. average indistinguishability 1/n Exp_M | P_{E|M} - P_E |_1 for a uniform message M goes to 0 (again average refers over the blocklegth n, clearly there is also the average over M)
  2. total indistiguishability Exp_M | P_{E|M} - P_E |_1 for a uniform message M goes to 0
  3. indistinguishability |P_{E|m} - P_{E|m'}|_1 for any two messages m and m' goes to 0.

Each of the indistiguishabilities can also be written using KL digvergence instead of statistical distance, in which case the conditions are exactly equivalent to their mutual information versions.

Strong secrecy is the standard security requirement considered in information-theoretic security, while semantic security is the minimum requirement considered in computational security.
Information-theoretic (physical-layer) security differs from computational security in that the secrecy is guaranteed irrespective of the power of the adversary, while in computational security E is computationally bounded. Computational security also assumes that the message is at least of a certain length for the schemes to work, and thus if the message to be secured is too small it needs to be padded to a larger message.

In practice, information theoretic security is expensive, because the messages that can be secured can be only as long as the keys that can be generated. However, in identification only a very small part of the message needs to be secured, which in computational security triggers padding and thus waste, but on the other side makes information-theoretic security accessible and not so expensive.

At the same time, the security of identification implicitly requires semantic security. It has been known for a while that hash functions provide information-theoretic strong secrecy. However, because the standard for information-theoretic security has been strong secrecy, before https://arxiv.org/abs/2102.00983 no efficient functions where known to provide information-theoretic semantic security.
We need an implementation of these type of functions so that we can integrate information-theoretic security into our identification project.

Supervisor:

[quantum] Realignment criterion and upper bounds in device-independent QKD

Description

This paper uses the partial transpose as a tool to derive upper bounds on device-independent QKD
https://arxiv.org/abs/2005.13511
In this project the goal is to try to generalize the above to the other tools like the reallignment criterion:
https://arxiv.org/abs/quant-ph/0205017
https://arxiv.org/abs/0802.2019

Prerequisites

basics of quantum information/quantum formalism

Supervisor:

[quantum] Semantic security of infinite-dimensional classical-quantum channels

Description

Generalize semantic security of classical-quantum channels to infinite dimensional channel (not necessarily gaussian)

Prerequisites

quantum information theory

Supervisor:

[quantum] Asymptotic continuity of restricted quantum relative entropies under general channels

Keywords:
quantum, relative entropy, Pinsker, reverse, inequality, information thoery, asymptotic, continuity

Description

Asypmtotic continuity is a property in the form of inequalities (classically known also as inequalities of the reverse-Pinker type) that is necessary to prove upper bounds on operational capacities.

The (quantum) relative entropy (also known as quantum divergence and classically also known as Kullbackt-Leibler divergence), can be used to define various entanglment measures many of which have a proven asymptotic continuity.

Of particular interest are the restricted quantum relative entropies defined by Marco Piani (https://arxiv.org/abs/0904.2705), many of which satisfy asymptotic continuity (A.S.)

In the above there are maybe 2-3 different proof styles.
We can group the results in the above as follows:

  • A.S. for entropy, conditional entropies, mutual information, conditional mutual information
  • A.S. for relative entropies with infimum over states on the second argument
  • A.S. relative entropies with infimum over state *and maximization over measurement channels*

The goal of the project is to generalize the last case to asymptotic continuity for relative entropies with infimum over state and maximization over *general* channels.

Possible new proof directions are

Prerequisites

Knowledge of quantum information is highly recommended/required.
Knowledge of matrix analysis will be a strong advantage.

Contact

roberto.ferrara@tum.de

Supervisor:

[quantum] Practical protocols for quantum synchronization in classical network

Keywords:
quantum, network, synchronization

Description

Prerequisites

Knowledge of quantum theory as provided by the course Algorithms in Quantum Theory or similar

Supervisor:

[quantum] Entanglement-measures upper bounds on device-independent distillable key

Keywords:
quantum, qkd, entanglement

Description

The goal of this work is to try to upper bound the device-independent distillable key in terms of locally restricted relative entropy of entanglement (an entanglement measure).

The following are relevant works/articles

Prerequisites

Strong background in quantum theory is required, preferably in quantum information theory, which is not covered by the course Algorithms in Quantum Theory

Supervisor:

Explicit Construction of Deterministic Identification Codes

Keywords:
Identification via channels, identification codes,

Description

In this thesis, the student after studying deterministic identification will construct the explicit codes for certain channels.

Prerequisites

Interested student are encouraged to contact me and send me a CV as well as all the academic transcripts and relevant courses that they have attended.

As well familiarity with the following is required:

Background in Information Theory and Channel Coding

Familiarity in fundamentals of Identification Theory

Supervisor:

Mohammad Salariseddigh

Error Correction in DNA Storage

Keywords:
DNA storage, Error Correction, Deletion, Insertion, Substitutions

Description

DNA storage is an uprising topic in the research field of storage systems. Due its natural longetivity, robustness, and density properties the main application would arise in high-dense long-term storage systems. The interest has become larger and larger due the large amount of data nowadays and the relative new biological advances in DNA synthesis and sequencing processes (e.g. polymerase chain reaction). In contrary to conventional storing methods, due to the nature of DNA and the involved biological processes special error patterns such as insertion, deletion, and substitution errors occur. To tackle these errors novel methods for correction have to be investigated. Moreover, the model of the DNA storage channel needs to be investigated thorougly, e.g. capacity statements.

 

 

 

Prerequisites

  • Linear Algebra
  • Channel Coding
  • Coding Theory for Storage and Networks (optional)

Supervisor:

Error Correction for DNA-Based Data Storage

Description

DNA-based data storage is a novel approach for long term digital data archiving.

Due to the unique nature of writing and reading DNA, the channel associated with these processes is still realtively poor understood and varies over different  synthesis (writing) and sequencing (reading) technologies. The task of the student is to analyze different sequencing methods and the associated errors and formulate associated channel models. Based on these models, error-correcting schemes shall be evaluated.

Prerequisites

- Basic principles of stochastic and algebra
- Channel Coding
- Information Theory

Supervisor:

Research Internships (Forschungspraxis)

[identification] Pseudo-Random Identification

Keywords:
random pseudo identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

One advantage can be gained by using pseudo randomness to generate both the input and the code itself.
Your task will be implementing the identification codes described in the attached pdf (an english translation of a paper published in russian in a russian journal) aiming at the fastest implementation and smallest collisions, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI from TUM and CeTI from TU Dresden, the latter having already some preliminary implementation of pseudo-random identification using various pseudo-random generators. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[quantum] Quantum Machine Learning for Communication

Keywords:
physical, layer, quantum, machine learning, non-linear

Description

As part of an ongoing project with Huawei we are looking into quantum machine learning algorithms applied to decoding at the end of an optical fiber in the non-linear regime.

So far we have tried only the quantum version of k-mean clustering, however the goal is to test further quantum algorithms, in particular quantum support vector machines next, and their classical quantum-inspired counterpart.

The projects will involve reading the literature on quantum machine learning algorithms and quantum-inspired algorithms, find or come up with an implementation (this will involve the use of quantum libraries, in particular so far we have use qiskit), and benchmark the performance.

Prerequisites

Knowledge of quantum mechanics or quantum information is highly recommended.

Supervisor:

Successive Cancellation Inactivation Decoding over q-ary Erasure Channels

Description

The student is expected to understand a recent decoding algorithm called successive cancellation inactivation (SCI) decoding [1] and extend it towards q-ary erasure channels.

 

[1] https://ieeexplore.ieee.org/abstract/document/9174226

Prerequisites

The student is expected to have a good understanding of linear algebra and be able to implement via Matlab or Julia. The following courses are beneficial:

- Information Theory

- Channel Coding

- Channel Codes for Iterative Decoding

Contact

mustafa.coskun@tum.de

Supervisor:

Mustafa Coskun

Information freshness in next-generation IoT networks

Description

See the attached document, i.e., click on "Diese Seite als PDF öffnen".

Contact

andrea.munari@dlr.de

Supervisor:

Mustafa Coskun - Dr. Andrea Munari (German Aerospace Center (DLR))

Ball Collision Decoding on Interleaved Codes

Description

Ball collision decoding has smaller work factor compared to information set decoding in decoding random codes.

The goal is to develop the ball-collision decoding algorithm for interleaved codes and derive its work factor.

Supervisor:

[identification] Implementation of identification with algebraic-geometry (Goppa) codes

Keywords:
goppa algebraic geometry codes identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing identification with Goppa codes, aiming at the fastest implementation, and testing their performance in comparison to other current implementations. The reference articles for this implementation are:

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Implementation of identification with universal hash functions

Keywords:
universal hash identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing the identification codes described in

aiming at the fastest implementation, and testing their performance in comparison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Implementation of identification with Polar codes

Keywords:
polar codes identification

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be implementing identification with polar codes, aiming at the fastest implementation, and testing their performance in comperison to other current implementations.

For reference, our previous work on identification based on Reed-Solomon and Reed-Muller code can be found at

The coding will be in Python/Sagemath.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Supervisor:

[identification] Simulation and performance improvement of identification codes

Description

Identification is a communication scheme that allows rate doubly exponential in the blocklemght, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.

The double exponential growth presents various challenges in the finite regime: there are heavy computational costs introduced at the encoder and decoder and heavy trade-offs between the error and the codes sizes.

The ultimate goal is to find a fast, reliable implementation while still achieving large code sizes.

Identification codes can be achieved by first removing the errors from the channel with regular transmission channel coding, and then sending a challenge though the corrected channel. For every identity i, The channenge is generated by picking a random input m and computing the corresponding output T_i(m) using a function T_i that depends on the identity. The challenge is then the pair m,T_i(m) and the receiver wanting to verify an identity j will verify whether j=i by testing the challenge. This is done by recomputing the output with T_j and verifying whether T_j(m)= T_i(m). The errors are reduced by ensuring that the various functions collide on a small fraction of the possible inputs.

It turns out that choosing good sets of funtions {T_i} is the same as choosing error-correction codes {c_i} with large distance, where now each codeword c_i defines a function by mapping positions m (sometimes called code locators) to symbols c_im of the codeword.
We can thus construct identification codes by choosing error-correction codes where we are only interested in the performance of the error correction encoders (we are not interested in the error-correction decoder or error-correction codes).

Your task will be speeding up the current implementations based on Reed-Solomon and Reed-Muller codes:

The coding will be in Python/Sagemath.
This work can accomodate multiple students.
The working language will be in English.

Environment: we collaborate with LTI. At LNT and LTI there is currently a lot of funding for research in identification. Therefore you will find a large group of people that might be available for discussion and collaboration.

Prerequisites

Nachrichtentechnik 2

 

Supervisor:

[quantum] Realignment criterion and upper bounds in device-independent QKD

Description

This paper uses the partial transpose as a tool to derive upper bounds on device-independent QKD
https://arxiv.org/abs/2005.13511
In this project the goal is to try to generalize the above to the other tools like the reallignment criterion:
https://arxiv.org/abs/quant-ph/0205017
https://arxiv.org/abs/0802.2019

Prerequisites

basics of quantum information/quantum formalism

Supervisor:

Identification Codes via Prime Numbers

Keywords:
Identification via channels, Prime Number Encryption
Short Description:
An approach for construction of identification codes for noiseless channel by means of the prime number encryption would be studied.

Description

In original scheme of identificaion via channels (Ahlswede and Dueck, 1989), a non-constructive method for coding for noiseless channel was studied. To address the explicit construction of identificaion codes, foremost Ahlswede and Verboven, 1991 provide a number theoretic approach based on the two successive prime number encryption. This method require the knowledge of first 2^n prime numbers for a block-length of n codeword. In this research internship, this method along with related prime number encryption tools and theorems would be investigated. Further, the extension of this scheme to a general DMC will be analyzed.

Prerequisites

Interested student are encouraged to contact me and send me a CV as well as all the academic transcripts and relevant courses that they have attended.

As well familiarity with the Basics of following is required:

  1. information/identification theory
  2. channel coding
  3. prime number theorem (Chebyshev)

Supervisor:

Mohammad Salariseddigh

On the Equivalence of Identification and Authentication

Keywords:
Identification via channel, identification codes, authentication, authentication codes
Short Description:
A Certain equivalence of identification and authentication would be shown.

Description

It would be shown that under suitable formulations (preserving all salient features) the two problem of Identification (Ahlswede and Dueck, 1989) and Authentication (Simmons, G. J. 1984) are in essence very close to each other. This equivalency was conjectured first by M. S. Pinsker. In this research internship the student is expected to address this conjecture. Both problems must be studied separately and then the similar essence of them should be drawn out. In particular the identification codes and authentication codes along with theire relation will be investigated.

 

 

Prerequisites

  1. Background in Information Theory and Channel Coding
  2. Familiarity with fundamentals of Identification Theory

 

References:

  1. Simmons, G. J. 1984, “Message authentication: a game on hypergraphs,” Congressus Numer. 45:161-192.
  2. Simmons, G. J. 1982, “A game theory model of digital message authentication,”  Congressus Numer., 34, 413-424
  3. Simmons, G. J. 1985, “Authentication theory/coding theory,” in: Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, pp. 411-432.
  4. E. Gilbert, F. J. MacWilliams and N.J. A. Sloane, 1974, “Codes which detect deception,” Bell System Tech. J., 53, 405-424.
  5. R. Ahlswede and G. Dueck, “Identification via channels,” in IEEE Trans. on Inf. Theory, vol. 35, no. 1, pp. 15-29, Jan. 1989, doi: 10.1109/18.42172.
  6. L. A. Bassalygo, M. V. Burnashev, “Authentication, Identification, and Pairwise Separated Measures”, Problems Inform. Transmission, 32:1 (1996), 33–39

Supervisor:

Mohammad Salariseddigh

Error Correction in DNA Storage

Keywords:
DNA storage, Error Correction, Deletion, Insertion, Substitutions

Description

DNA storage is an uprising topic in the research field of storage systems. Due its natural longetivity, robustness, and density properties the main application would arise in high-dense long-term storage systems. The interest has become larger and larger due the large amount of data nowadays and the relative new biological advances in DNA synthesis and sequencing processes (e.g. polymerase chain reaction). In contrary to conventional storing methods, due to the nature of DNA and the involved biological processes special error patterns such as insertion, deletion, and substitution errors occur. To tackle these errors novel methods for correction have to be investigated. Moreover, the model of the DNA storage channel needs to be investigated thorougly, e.g. capacity statements.

 

 

 

Prerequisites

  • Linear Algebra
  • Channel Coding
  • Coding Theory for Storage and Networks (optional)

Supervisor:

Error Correction for DNA-Based Data Storage

Description

DNA-based data storage is a novel approach for long term digital data archiving.

Due to the unique nature of writing and reading DNA, the channel associated with these processes is still realtively poor understood and varies over different  synthesis (writing) and sequencing (reading) technologies. The task of the student is to analyze different sequencing methods and the associated errors and formulate associated channel models. Based on these models, error-correcting schemes shall be evaluated.

Prerequisites

- Basic principles of stochastic and algebra
- Channel Coding
- Information Theory

Supervisor:

Seminar Topics

The three Seminars "Seminar on Coding and Cryptography", "Seminar on Digital Communications" and "Seminar on Optical Communications" are organized jointly.

You can find more information at Seminar Topics.