Talk:Cryptographic hash function/to do


 * Terminology; a lot of alternative names for the crypto properties and functions which hold them; distinction between Keyed and unkeyed hash functions (stick to unkeyed here);
 * Discussion of the "Merkle-Damgård structure" that MD4/5, SHA etc follow; a diagram would be appropriate.
 * Hash functions constructed from block ciphers - Davies-Meyer etc. (Applied Cryptography goes into detail on these)
 * Hash functions used to construct other primitives; e.g. block ciphers from hash functions (e.g. SHACAL, BEAR and LION), stream ciphers (SEAL), MACs from hash functions (HMAC) and PRNGs.
 * Discuss recommended sizes for hash functions; quantify "hard", MD5CRK. Perhaps mention the birthday paradox?
 * Provide a little detail about specific, popular hash functions
 * Give an example of Yuval's collision attack on signing hashed messages.
 * History?
 * regarding this statement in the article, " Therefore, Alice writes down her solution, appends a random nonce, computes its hash and tells Bob the hash value (whilst keeping the solution secret)." Please clarify if Alice gives Bob the nonce in addition to the hash.
 * Discuss reverse lookup tables (such as http://md5.crysm.net/)
 * (Non technical) For some reason this article does not seem to print as a pdf from Wikipedia. I have no problem printing a pdf from my pc. Printing was tried on both Firefox and IE.