Modern Cryptography

Moderne Cryptografie

Course manual 2023/2024

Course content

This course will introduce you to the foundations of modern cryptography, with an eye toward practical applications. We will learn the importance of carefully defining security; of relying on a set of well-studied “hardness assumptions” (e.g., that factoring large numbers is hard, or that AES is a pseudorandom function); and of the possibility of proving security of complicated constructions based on low-level primitives. We will not only cover these ideas in theory, but will also explore their real-world impact. You will learn about cryptographic primitives in wide use today, and see how these can be combined to develop modern protocols for secure communication.

(from Jon Katz's online course on coursera whose contents are closely related to this course, check out the course overview video!)

Study materials

Literature

• Mike Rosulek, The Joy of Cryptography, https://joyofcryptography.com/ 

Other

• Jonathan Katz: Cryptography, online course on coursera.org

Objectives

• distinguish modern-day cryptography from ancient cryptography
• explain the difference between encryption and authentication
• explain the difference between private- and public-key cryptography
• compare different security notions (indistinguishability, CPA, CCA) for private- and public-key encryption
• apply security notions for private- and public-key authentication
• recognize the discrepancy between theoretically secure and practically used cryptography
• recognize aspects of number theory which are relevant to cryptography
• explain basic computational problems that are important for cryptography such as the factoring problem, the RSA problem, the discrete-logarithm problem
• collaborate (under guidance of teachers) in small groups of four to five (unknown) students on practice problems. In particular, students who are already well-versed in certain topics or skills are encouraged to help their fellow group members in this respect, while weaker students are encouraged to seek help from their peers and the teachers whenever necessary
• present solutions of mathematical problems orally to peers

Teaching methods

• Flipped-classroom work session
• Zelfstudie
• Presentatie/symposium

This course will be taught in a flipped-classroom styleLinks to an external site. with elements of team-based learningLinks to an external site. sprinkled in. 

Check this videoLinks to an external site. or this infographicLinks to an external site. to learn more about flipped-classroom style. For you as a student, the biggest difference to conventional lectures is that you have to prepare yourself before attending classes, as it is assumed during classes that you have studied the material already. The advantage of this model is that we can spend the "face-to-face" time during the work sessions to talk about the studied material together, to recapitulate the most difficult and important aspects, and to strengthen our understanding by actually working on the relevant problems in small groups. The work sessions will be led by the teacher and TAs, with the active involvement of the students. As a student put it wisely in a previous course evaluation: "The thing with flipped-classroom is that it is only successful when both the teachers and the students take a pro-active role."

Learning activities

Attendance

Programme's requirements concerning attendance (OER-B):

• For practical trainings and tutorials/seminars with assignments attendance is, in principle, obligatory. When students do not meet the requirements for attendance, this may lead to not finishing a course with a pass mark.
  

Additional requirements for this course:

Please attend all sessions.

Assessment

For all homeworks, all members of a team receive the same grade.

The grade obtained at the exam counts for 50% towards the final grade, you have to have at least a score of 50% at the final exam to pass the course!

There will be a written final (in-person) exam as indicated on Datanose. We will ask you to solve a subset of the reading questions, other Canvas quizzes, and some of the exercises listed in the "Exam Problems", or some minor variations of them. The exam is on paper and closed-book, i.e. WITHOUT notes/internet/electronic devices. We will provide you with all necessary definitions, for example all those in listed in the "Index of Security DefinitionsLinks to an external site."

Assignments

Homework

There will be 6 homework problem series. They can be handed in in groups of up to 4 students where all students will receive the same grade.

Fraud and plagiarism

Over het algemeen geldt dat elke uitwerking die je inlevert ter verkrijging van een beoordeling voor een vak je eigen werk moet zijn, tenzij samenwerken expliciet door de docent is toegestaan. Het inzien of kopiëren van andermans werk (zelfs als je dat hebt gevonden bij de printer, in een openstaande directory of op een onbeheerde computer) of materiaal overnemen uit een boek, tijdschrift, website, code repository of een andere bron - ook al is het gedeeltelijk - en inleveren alsof het je eigen werk is, is plagiaat.

We juichen toe dat je het cursusmateriaal en de opdrachten met medestudenten bespreekt om het beter te begrijpen. Je mag bronnen op het web raadplegen om meer te weten te komen over het onderwerp en om technische problemen op te lossen, maar niet voor regelrechte antwoorden op opgaven. Als in een uitwerking gebruik is gemaakt van externe bronnen zonder dat een bronvermelding is vermeld (bijvoorbeeld in de rapportage of in commentaar in de code), dan kan dat worden beschouwd als plagiaat.

Deze regels zijn er om alle studenten een eerlijke en optimale leeromgeving aan te kunnen bieden. De verleiding kan groot zijn om te plagiëren als de deadline voor een opdracht nadert, maar doe het niet. Elke vorm van plagiaat wordt bestraft. Als een student ernstige fraude heeft gepleegd, kan dat leiden tot het uitschrijven uit de Universiteit. Zie voor meer informatie over het fraude- en plagiaatreglement van de Universiteit van Amsterdam: www.student.uva.nl

Course structure

Timetable

The schedule for this course is published on DataNose.

Additional information

This course has a significant mathematical component. No advanced mathematics background is assumed, but students are expected to have "mathematical maturity" since many of the concepts will be abstract, rigorous definitions and proofs will be given, and some advanced mathematics (group theory, number theory) will be covered. Basic background in discrete mathematics (probability, modular arithmetic) and analysis of algorithms (big-O notation, reading pseudocode) is assumed. 

Moreover, some of the homeworks might require programming. 

The course will be taught in English, homework should be handed in in English. Human interactions in Dutch are no problem.

Additional information about the course will be available on Canvas.

Contact information

Coordinator

• prof. dr. C. Schaffner

Docenten

• Christian Schaffner
• Léo Colisson