Resources
Online Books
Books
Links
Most Important Facts
Classic Ciphers
Classic Cryptanalysis
Perfect Secrecy and Information Theory
Modern Ciphers
Probability Theory
Elementary Number Theory
Public Key Cryptosystems
Random Oracle Model
- How
To Prove Yourself: Practical Solutions to Identification and Signature
Problems, Fiat and Shamir, 1987. Paper that, among other
important contributions, suggest the heuristic of considering a
hash function as if it was random.
- Random
oracles are practical: A paradigm for designing efficient
protocols, Bellare and Rogaway, 1993. Proposing the random
oracle model as a general practical tool to construct efficient
cryptographic schemes.
- The Random Oracle
Methodology, Revisited, Canetti,
Goldreich, and Halevi, 1998. First paper proving that the
random oracle methodology is unsound.
- Indifferentiability,
Impossibility Results on Reductions, and Applications to the Random
Oracle Methodology, Maurer, Renner, and Holenstein. Especially the
first part of this paper gives a simple explaination of the key issue
with random oracles.
Hashfunctions
Pseudo-Random Generators
|