Talk:Secure Hash Algorithms

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Cryptography: Computer science High‑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. High This article has been rated as High-importance on the importance scale. This article is supported by WikiProject Computer science (assessed as High-importance). Computing: Security Mid‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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. Mid This article has been rated as Mid-importance on the project's importance scale. This article is supported by WikiProject Computer security (assessed as High-importance). Things you can help WikiProject Computer security with: edit history watch purge Article alerts are available, updated by AAlertBot. More information... Review importance and quality of existing articles Identify categories related to Computer Security Tag related articles Identify articles for creation (see also: Article requests) Identify articles for improvement Create the Project Navigation Box including lists of adopted articles, requested articles, reviewed articles, etc. Find editors who have shown interest in this subject and ask them to take a look here.

Proposed merge with Secure Hash Standard

Latest comment: 7 years ago4 comments4 people in discussion

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

• 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)Reply
• Merge Agree with Becksguy--Freshman404^Talk 13:44, 7 January 2018 (UTC)Reply
• 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)Reply

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

Latest comment: 7 years ago1 comment1 person in discussion

Hi

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)Reply

SHA-512 is vulnerable to the length extension attacks?

Latest comment: 4 months ago1 comment1 person in discussion

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 @Claw of Slime: who introduced the text (and the table). Dimawik (talk) 22:57, 7 April 2025 (UTC)Reply