• Book: Understanding Cryptography – Paar/Pelzi
  • Course: Introduction to Cryptography (YouTube) – Paar
  • Website: zkhack.dev - by Boneh?
  • Course: Cryptography 1 - Boneh

  • Exercises: Cryptopals

  • Quantum computers break the hardness assumption of discrete log and factoring primes.
    • RSA is broken.
    • SHA256 has a sqrt() (quadratic) improvement - i.e. 256 -> 128.

Quantum computers are struggling with quantum error correction.