Crypto Foundations Checkpoint

Threat models, security goals, randomness, and the birthday bound.


1. Which pairing correctly maps a security goal to a failure?
2. A chosen-ciphertext attacker can:
3. Computational security means:
4. If a hash has b-bit output, generic collision search costs about:
5. Why is modulo bias a problem when mapping random 64-bit values to [0,n)?
6. Which statement is true about PRNGs used for cryptography?
7. The main difference between integrity and authenticity is:
8. An information-theoretically secure scheme requires:
9. True/False: If you reuse a one-time pad key, knowing one plaintext lets you recover the other.
10. Which is the best high-level rule for threat modeling?
11. Which property is NOT provided by encryption alone?