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 76725
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.
0
votes
0
answers
224
views
How can I prove a truncated hash fuction need not be collision resistant?
Let $H : \{0, 1\}^∗ \mapsto \{0, 1\}^ n$ be a collision-resistant hash function. Define $H_0(M) = H(M)\mathbin\|0^{n−10}$. That is, $H_0$ appends ($n − 10$) zeros to the output of $H$. …
- 1