Content deleted Content added
you can have unconditionally secure crypto protocols, you know... |
m Linked 'perfect' to 'Perfect hash function'. |
||
Line 1:
A '''random oracle''' is a theoretical model of a [[Percect hash function|perfect]] [[cryptographic hash function]]. It is used in proofs that indicate that [[cryptography|cryptographic]] systems or protocols are secure by showing that an attacker must either consider how the hash function works, or solve some other problem believed hard, in order to break the protocol.
When a random oracle is given a query ''x'' it does the following:
| |||