R1. Summarize the challenges of key management.
R2. If we need enough entropy for a 16-byte key, why should we hash a 20-byte (or larger) passphrase?
R3. Explain the reused key stream problem.
R4. Describe the role of the nonce in preventing reused key streams when using the same passphrase to encrypt different files.
R5. Describe how key wrapping may be applied to file encryption.
R6. What is the difference between key splitting and key wrapping?
R7. Summarize the reasons for rekeying an encrypted file.
R8. Describe the different categories of asymmetric encryption algorithms and how they are used in practice.
R9. What information must be shared to implement Diffie-Hellman key sharing? What is the result?
R10. What information must be shared to exchange a wrapped key using RSA?