Seminar in provable security

I did a cryptography seminar in provable security in the fall 2018. We looked at e.g. security proofs for Chosen Plaintext Attacks (CPA) and Chosen Ciphertext Attacks (CCA/CCA2), using the Random Oracle Model (ROM) and more. This is the papers we looked at:

My favorite courses as an undergrad and graduate student

I’ve taken a lot of classes in mathematics and computer science as a part of my bachelor program and master program in mathematics. I’ve always found topics like number theory, algebra, algorithms and cryptography the most interesting. Here is a list of my personal favorites:

NTNU:

Berkeley:

  • Number Theory (MATH254A)
  • Approximation Algorithms (CS294)
  • Randomness and Computation (CS271)