Talk:Secure Hash Algorithms

Cryptography: Computer science Start‑class Mid‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Mid-importance).

Could use some editing, but maybe some people will think some of this is a good way to explain secure hash to the nontechnical person.

A good secure hash algorithm is defined as, in the worst case of the hacker looking at your worst hashes that give away the most knowledge about what they are hashes of (the input), the hacker must do more calculations, even with good statistics and estimations, to figure out anything at all about what went into the algorithm. It is to remove all except the most meaningless pseudorandomness that would take the smartest supercomputer maximum time to learn anything about. The hacker can not use the algorithm to, even while seeing its entire source code and being able to play with it and variations of it and hook it into his best tools, find any possible input which outputs the same hash as any other input, and part of that is to not be able to duplicate the hashes that I've already given him (they give these as separate conditions since they are different difficulty). It is nonsensical, pure stupidity with extreme strategy to be the most pointless of all time, having no measurable pattern. In a word, secure hash is religion in binary. — Preceding unsigned comment added by 97.89.104.85 (talk) 02:05, 8 June 2014 (UTC)[reply]

Proposed merge with Secure Hash Standard

This article is a non-stub article, and also give brief descriptions to each algorithm, in contrast to the article to be merged/redirected here. NasssaNser (^talk/_edits) 08:48, 3 April 2017 (UTC)[reply]