[Q&A] Foundations of cryptography

• Do OWF imply $\mathsf{P} \neq \mathsf{NP}?$ (short answer: yes)
• How does the random oracle model help with constructing secure cryptographic primitives?
• What are the common idealized models in cryptography?
• Can we have cryptography in a world where $\mathsf{P} = \mathsf{NP}?$? (short answer: possibly!)
• How do we estimate that an assumption is sufficiently safe?
• Can the hardness of “breaking a cryptosystem” be based on an NP-complete problem?
• Are there good candidate OWFs with a very simple structure (like, “4 lines of code”-simple)? (short answer: yes)
• How to prove that weak OWFs cannot have a polysize range?