are captured continuously and without contextualization.  Surveillance can be found in public spaces, such as monitoring places and streets, as well as in the private sphere, for example through the use of health apps or virtual assistants. Surveillance is constantly being expanded with new methods such as face and voice recognition or gait analysis.
   
On the basis of selected information technology systems, the role of computer science in the context of surveillance will be presented and discussed. Students can search for examples of information technology systems themselves or choose from given subject areas. The individual areas of application will be examined comparatively and an attempt will be made to assess the social change processes associated with surveillance using social science theory and empirical research.

Basic knowledge of scientific work is imparted in order to work on the topic area.

Literatur (englisch und deutsch) wird zum Beginn der Veranstaltung bekannt gegeben.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

are captured continuously and without contextualization.  Surveillance can be found in public spaces, such as monitoring places and streets, as well as in the private sphere, for example through the use of health apps or virtual assistants. Surveillance is constantly being expanded with new methods such as face and voice recognition or gait analysis.
   
On the basis of selected information technology systems, the role of computer science in the context of surveillance will be presented and discussed. Students can search for examples of information technology systems themselves or choose from given subject areas. The individual areas of application will be examined comparatively and an attempt will be made to assess the social change processes associated with surveillance using social science theory and empirical research.

Basic knowledge of scientific work is imparted in order to work on the topic area.

Literatur (englisch und deutsch) wird zum Beginn der Veranstaltung bekannt gegeben.

are captured continuously and without contextualization.  Surveillance can be found in public spaces, such as monitoring places and streets, as well as in the private sphere, for example through the use of health apps or virtual assistants. Surveillance is constantly being expanded with new methods such as face and voice recognition or gait analysis.
   
On the basis of selected information technology systems, the role of computer science in the context of surveillance will be presented and discussed. Students can search for examples of information technology systems themselves or choose from given subject areas. The individual areas of application will be examined comparatively and an attempt will be made to assess the social change processes associated with surveillance using social science theory and empirical research.

Basic knowledge of scientific work is imparted in order to work on the topic area.

Literatur (englisch und deutsch) wird zum Beginn der Veranstaltung bekannt gegeben.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

This seminar will cover central aspects of modern bottom-up proteome analysis by mass spectrometry with a focus on bioinformatic algorithms and data analysis.

After a brief introduction to the field of mass spectrometry-based proteomics (instrument types, data properties, overview of bioinformatics challenges) we will explore the big cornerstones, including isotope models and averagines, scoring algorithms for the identification of mass spectra, false-discovery-rate estimation using decoy peptides, absolute and relative quantification of proteins and correlation between mRNA and protein expression.

This seminar will cover central aspects of modern bottom-up proteome analysis by mass spectrometry with a focus on bioinformatic algorithms and data analysis.

After a brief introduction to the field of mass spectrometry-based proteomics (instrument types, data properties, overview of bioinformatics challenges) we will explore the big cornerstones, including isotope models and averagines, scoring algorithms for the identification of mass spectra, false-discovery-rate estimation using decoy peptides, absolute and relative quantification of proteins and correlation between mRNA and protein expression.

This Seminar will address IT-Security subjects.

Details and description to be added soon.

1. Anderson, Ross. "Why cryptosystems fail." In Proc. ACM Conference on Computer and Communications Security (CCS), pp. 215-227. ACM, 1993.
2. Whitten, Alma, and J. Doug Tygar. "Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0." In Usenix Security, vol. 1999. 1999.
3. Artikel aus den Tagungsbänder der Konferenzen CHI, SOUPS, ACSAC.

Students are expected to:

Give a technical presentation of their assigned topics; Demonstrate research software prototypes whenever applicable; Turn in a short technical report on their assigned topics (10 pages).

Students will be graded on their preparedness for discussion, their presentations and their seminar report. The report must be typeset in LaTeX. Both the LaTeX source and the PDF generated from it must be submitted as a TAR or ZIP archive. A LaTeX template is here.

The seminar report must contain references to all the articles that were used. Each literature entry must include a brief and concise summary of the article's contribution and the contribution's benefits. Please use the BibTex "note" field for this purpose and inline the bibliography by including the bbl file into the LaTeX source.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

are captured continuously and without contextualization.  Surveillance can be found in public spaces, such as monitoring places and streets, as well as in the private sphere, for example through the use of health apps or virtual assistants. Surveillance is constantly being expanded with new methods such as face and voice recognition or gait analysis.
   
On the basis of selected information technology systems, the role of computer science in the context of surveillance will be presented and discussed. Students can search for examples of information technology systems themselves or choose from given subject areas. The individual areas of application will be examined comparatively and an attempt will be made to assess the social change processes associated with surveillance using social science theory and empirical research.

Basic knowledge of scientific work is imparted in order to work on the topic area.

Literatur (englisch und deutsch) wird zum Beginn der Veranstaltung bekannt gegeben.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.