• Lecturer: Prof. Dr. May
• Language: German
• Credits: 5 CP
• Programs: B.Sc. IT-Security, M.Sc. Applied Computer Science, M.Sc. Computer Science, M.Sc. IT-Security / Networks and Systems
• Examination: 100 % Written Exam (120 Minutes) + 10 % Homework

Prior Knowledge

• Introduction to Cryptography 1
• Introduction to Cryptography 2

Learning Outcomes

Students have an understanding of the essential mathematical methods and procedures on which modern cryptographic procedures are based. The depth of the treatment of the procedures goes well beyond the previous courses. Participants will be able to analyze and design current and future cryptographic methods. They also demonstrate an awareness of the methodology and power of various attack scenarios.

Course Description

An introduction to modern methods of symmetric and asymmetric cryptography is provided. For this purpose, an attacker model is defined and the security of the presented encryption, hashing and signature methods is proven under well-defined complexity assumptions in this attacker model. Topic Overview:

• Secure encryption against KPA, CPA, and CCA attackers
• Pseudorandom functions and permutations
• Message Authentication Codes
• Collision-resistant hash functions
• Block Ciphers
• Construction of random number generators
• Diffie-Hellman key exchange
• Trapdoor one-way permutations
• Public Key Encryption: RSA, El-Gamal, Goldwasser-Micali, Rabin, Paillier
• One-Way Signatures
• Signatures from collision-resistant hash functions
• Random Oracle Model