Some open problems

• Do one-way functions exist?
• Is factoring truly difficult?
• Are discrete logarithms hard to compute?
• Is Diffie-Hellman key exchange equivalent to discrete logarithms?
• Is factoring equivalent to decrypting RSA?
• How long can you safely use a key?
• Do there exist reasonable theories of security with practical constructions?
• Does P=NP?
• Do there exist more natural probabilistic models for information theoretic security?