Revision as of 19:58, 15 May 2005 edit Js coron (talk \| contribs) 29 edits OAEP and PSS secure in the RO model. ← Previous edit		Revision as of 11:08, 6 July 2005 edit undo 220.227.240.178 (talk) No edit summary Next edit →
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:

Random oracle: Difference between revisions