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 hash
Search options not deleted
user 5293
A cryptographic hash algorithm is a function which takes a variable size input and produces a fixed size output. The algorithm makes it difficult to find two inputs with the same output or reconstruct the input from the output.
5
votes
Can we reverse a hash when we know part of the input?
It depends of course on the hash function you're dealing with. … Finding two inputs with the same output is a hash collision. …
- 429
6
votes
Accepted
Can a "pattern" in a series of passwords be detected from their hashes (and maybe a single r...
has a given hash
it is infeasible to modify a message without changing the hash
it is infeasible to find two different messages with the same hash
As Gumbo pointed out, strong hash functions result … Especially considering that all of the attacks on hash functions are actually interested in this:
Oh, the hash is x? y, z, a, b and c plaintexts all map to that hash for this algorithm. …
- 429
5
votes
2
answers
981
views
Are variable-length crypto hash functions still susceptible to collisions?
If so, how dependent is this resistance on the hash function itself? (I'm guessing the answer to this is "highly" or "entirely".) …
- 429