Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with sha-2
Search options questions only
not deleted
user 318
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).
32
votes
3
answers
6k
views
Are common cryptographic hashes bijective when hashing a single block of the same size as th...
It's been said that CRC-64 is bijective for a 64-bit block.
It the corresponding statement true for typical cryptographic hashes, like MD5, SHA-1, SHA-2 or SHA-3?
For example, would SHA-512 be bijec …
- 1,907
6
votes
0
answers
595
views
How hard is a known prefix hash preimage attack on SHA-2?
Suppose the attacker knows $X, Z$ such that
$H(X || Y) = Z$
If bit-length(Y) < 60 then a brute force attack is possible.
What if bit-length(Z) = 256 (such as in SHA-256), bit-length(X) = 128, or b …
- 1,907