|
Instructors: Prof. Dr. phil. nat. Marc Fischlin
Event type:
Lecture
Org-unit: Dept. 20 - Computer Science
Displayed in timetable as:
Kryptoplexität
Subject:
Crediting for:
Hours per week:
4
Language of instruction:
German
Min. | Max. participants:
- | -
Course Contents:
Algorithmic complexity of cryptographic primitives like one-way functions, digital signatures, commitments, encryption etc. In particular, the relationship of primitives, e.g., if one can turn signature schemes generally into encryption schemes. Relevant excursions to complexity theory.
Literature:
- Arora, Barak: Computational Complexity: A Modern Approach, 2007 (auch online erhältlich).
- Balcazar, Diaz, Gabarro; Structural Complexity I und II, 1995 (nicht mehr als Hardcover verfügbar)
- Katz, Lindell: Introduction to Modern Cryptography, 2007
- Goldreich: Foundations of Cryptography, Volume I und II, 2001 und 2004 (als Online-Variante erhältlich)
- Goldreich: Computational Complexity: A Conceptual Approach, 2006 (als Online-Variante erhältlich)
Preconditions:
Einführung in die Kryptographie
Expected Number of Participants:
Further Grading Information:
Official Course Description:
|
