Talk:Security of cryptographic hash functions: Difference between revisions

Content deleted Content added
Second paragraph: new section
Line 21:
 
:Most of this article is about provably secure hash functions. If we remove the section on cryptographic hash functions then the article can be suitably renamed "Provably secure hash function". The comparison to cryptographic hash functions is made in the lead section, so nothing is lost. [[User:Nxavar|Nxavar]] ([[User talk:Nxavar|talk]]) 09:52, 5 June 2014 (UTC)
 
== Second paragraph ==
 
''"In the second category are functions that are not based on mathematical problems but on an ad hoc basis, where the bits of the message are mixed to produce the hash. They are then believed to be hard to break, but no such formal proof is given. Almost all widely spread hash functions fall in this category. Some of these functions are already broken and are no longer in use."''
 
Seems to imply that the "second category of functions" algorithm necessarily 'mixes the bits or a message', and what does that even mean?