Recommended materials

Katz & Lindell: Introduction to Modern Cryptography

Lecture slides (Burcsi)

SageMath introduction

Classes

1. (13 Feb) – Classical cryptography: 0classic.sage

2. (20 Feb) – Breaking classical ciphers: 1break.sage

3. (27 Feb) – Random number generators: 2random.sage

4. (6 Mar) – Block ciphers I: AES: 3aes.sage

5. (13 Mar) – Block ciphers II: modes of operation: 4modes.sage

6. (20 Mar) – Hash functions: 5hash.sage

7. (27 Mar) – Midterm Test – classes 1-5

3 Apr – holiday

8. (10 Apr) – RSA encryption: 6rsa.sage

9. (17 Apr) – Diffie–Hellman key exchange: 7diffie.sage

10. (24 Apr) – Digital signatures: 8digsign.sage

1 May – holiday

8 May – holiday

11. (15 May) – Endterm Test – classes 6,8-10

Retake Test: 22 May, 10:00-12:00 (S 2-202 – same room)

Requirements

• Two tests (midterm + endterm):
  • computer exercises like in the classes;
  • 80 minutes each, on the classes (see dates above);
  • allowed: university computers, Sage, this website (including the Sage files), Sage website, your notes;
  • not allowed: internet, other device, other person, artificial intelligence;
  • 20 points each;
  • grade limits per test: 17- (5), 14- (4), 11- (3), 8- (2);
  • requirement: both tests pass (≥ 8 points);
  • you can retake one → it overrides the original.
• Final grade:
  • 40 points in total: 20 (midterm) + 20 (endterm);
  • grade limits: 34- (5), 28- (4), 22- (3), 16- (2);
  • if any test fails (after retake) → your grade is 1.
• Attendance is compulsory:
  • you can miss ≤ 3.5 classes;
  • absence is fractional (rounded to one decimal), e.g. being late 35 minutes is 0.4 abs., and being absent for 5 minutes is 0.1 abs.
• Prerequisite: Application of discrete models.
  • If you didn't pass that already, you cannot get a grade in Cryptography.