Questions tagged [sha-2]

SHA-2 is a family of cryptographic hash functions designed by the NSA and published by NIST in 2001. The family includes various output lengths (224, 256, 384, and 512 bits).

SHA-2 is a family of cryptographic hash functions , the de facto standard for current developments. It was originally published by NIST in 2001. It is based on a construction. It is replacing the older SHA-1 hash function and the even older MD5 .

The family comprises 6 functions with different output lengths.

  • SHA-256 and SHA-512 are the most commonly used hash functions. Their internal state and output size are both 256 for SHA-256 and both 512 for SHA-512. The algorithms are similar, but SHA-256 is expressed in terms of computations on 32-bit words while SHA-512 uses 64-bit words. SHA-512 has more rounds (80) than SHA-256 (64).
  • SHA-224 and SHA-384 are very similar to SHA-256 and SHA-512 respectively, but with output truncated to a smaller size, and different constants.
  • SHA-512/224 and SHA-512/256 (added in 2012) are truncated versions of SHA-512, also with different constants.

In 2012, NIST selected proposal for a SHA-3 algorithm. Although SHA-3 was initially intended as a replacement for SHA-2, it is now planned that SHA-2 and SHA-3 will coexist.

External links

136 questions
19
votes
3 answers

SHA-224 Purpose

One of the new features of Java 8 is the SHA-224 message digest. What is the use case for having a 224-bit-length hash?
user9070
9
votes
0 answers

Rationale for use of right-shift (rather than rotate) in SHA-2?

The SHA-2 hashes in FIPS 180 define $\Sigma$ and $\sigma$ bijections of words, with $\Sigma$ used in the round function, and $\sigma$ used in preparing 48 words of message schedule from 16 words of a message block. For example, in SHA-256 (using…
fgrieu
  • 140,762
  • 12
  • 307
  • 587
2
votes
2 answers

Mutating a SHA-2 input would allow us to have multiple hashes for a single input, would this increase SHA-2's security?

Let me elaborate: Say we have two distinct inputs: $A$ and $B$. We also have some arbitrary deterministic mutation protocol $M$ (for example reversing the characters and performing a Caesar cipher). Say by chance (I understand this is extremely…
kebab-case
  • 121
  • 2
2
votes
1 answer

Is "Bit Independence" of SHA-2 hashes secure?

I know bit independence is good in SHA2 function output, but is it truly 100% secure? For example: Y = SHA512(secretKeyNonce256bit) A = first 32ytes / 256bits of Y, used as message encryption key B = next 16bytes/128bits used as authentication…
Sean
  • 61
  • 3