Talk:Secure Hash Algorithms

{{WikiProject banner shell|class=Start|

{{WikiProject Computing |importance=Mid |security=y |security-importance=High}}

}}

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)

Merge This Secure Hash Standard stub contains two sentences and does not contain enough content to be a separate article at this time. - Becksguy (talk) 19:06, 11 April 2017 (UTC)
Merge Agree with Becksguy--Freshman404^Talk 13:44, 7 January 2018 (UTC)
Merge But note that there are two FIPS (namely 202 & 180) that specify federal-approved hashing algorithms. Dannyniu (talk) 12:22, 7 February 2018 (UTC)

You can unscramble the hashes of humanity's 5 billion email addresses in ten milliseconds for $0.0069

I'm not sure if this is the right article to add this information to, but it seems important

https://boingboing.net/2018/04/09/over-the-rainbow-table.html

John Cummings (talk) 07:41, 10 April 2018 (UTC)

SHA-512 is vulnerable to the length extension attacks?

In the corresponding cell of the table the security against the length extension attack is specified as 0 bits for SHA-512 (and SHA-256). This is highly unusual for actively used crypto hashes. No sources are provided. Pinging {{ping|Claw of Slime}} who introduced the text (and the table). Dimawik (talk) 22:57, 7 April 2025 (UTC)