Questions tagged [sha]

Secure Hash Algorithm is a family of cryptographic hash functions published by NIST. This includes SHA-1, and the SHA-2 and SHA-3 families of functions. SHA-1 is deprecated for all usages.

There are three major families of algorithms that have been standardized by NIST under the name "Secure Hash Algorithm". Each family has a different construction from the others so that a practical attack on one family will not compromise the other families.

SHA-1 is a cryptographic hash function with an output size of 160-bit, standardized by NIST in 1995. SHA-1 is deprecated for cryptographic use. The first theoretical attacks were published in 2005. As of Jan 2017, TLS involving SHA-1 is no longer accepted by major browsers. The first public collision attack on SHA-1 was published on 23 February 2017 by Google. [source]. NIST will retire all uses of SHA-1 from every standard by 2030.

SHA-2 is a family of cryptographic hash functions with output sizes ranging from 224 bits to 512 bits, standardized by NIST in 2001. SHA-2 hash functions are still considered secure for cryptographic use.

SHA-3 is a family of cryptographic hash functions with output sizes ranging from 224 bits to 512 bits, standardized by NIST in 2015. SHA-3 hash functions are still considered secure for cryptographic use. Organizations using SHA-2 are encouraged to also implement SHA-3 as a fallback in the event that an attack is discovered against SHA-2 and the industry needs to rapidly migrate away from SHA-2.

The above information was sourced from wikipedia.org/Secure_Hash_Algorithms.


Note that the SHA family of hash functions is designed to have efficient software and hardware implementations, and thus are not recommended for hashing passwords. Instead you should be using key derivation functions such as PBKDF2 or bcrypt which are designed to be slow, thus hampering brute-force attacks against hashed passwords.

310 questions
12
votes
5 answers

How did the Shattered.io group manage to create a SHA1 collision for a PDF that is similar looking to the original?

So I've been trying to understand what a SHA-1 collision is and what it means but there's one thing I'm not quite understanding. How did they manage to not only find two documents with the same hash - but also one that looks visually almost exactly…
stickman
  • 1,590
  • 3
  • 13
  • 19
4
votes
1 answer

What was the real-world cost of computing the SHAttered collision?

More specifically, how much wall-clock time did it take, and what was the cost in dollars of the computing power involved? From shattered.io I see that it took 6500 CPU-years + 110 GPU-years, which tells me roughly how much computing power but…
Jander
  • 1,001
  • 9
  • 12
2
votes
1 answer

Generating SHA-0

Unfortunately, I need to generate some SHA-0 hashes, I was using BouncyCastle and there's nothing in there to generating them. I know it's weak and not secure, but regardless, I have to be able to use it. I'm trying to avoid writing a method that…
g3trans
  • 75
  • 5
1
vote
1 answer

Is RSA-SHA1 secure enough for licensing?

We have to do a licensing system. It would be someting like A Ready To Use Software Licensing Solution in C# [CodeProject] But our client is worried about the SHA/SHA1 "weakness". I've searched the web about this, but the only thing I found is the…
JMA
  • 113
  • 5
0
votes
3 answers

Why can't we produce original text from sha1 if there is no random salt attached

I have bunch of cat images whose names are sha1 of website where it was posted. Here is an example: 3afec3b4765f8f0a07b78f98c07b83f013567a0a.jpg website: http://www.example.com/image.jpg If sha1 is simple/dumb function i.e. hash = sha1('text with no…
Josh
  • 3
  • 1