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 819
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.
6
votes
What alphanumeric string length can be used to guarantee no hash collisions from CRC-64?
$D^{(1)}(x)$ and $D^{(2)}(x)$ hash to the same check sum,
that is, $R^{(1)}(x) = R^{(2)}(x)$, if and only if
$D^{(1)}(x)$ and $D^{(2)}(x)$ differ by a multiple of $M(x)$
This result holds even if … For the simple case considered here, we have immediately
that
$$\deg D^{(1)}(x) = \deg D^{(2)}(x) = N-1 \geq \deg M(x) = 64$$
and so if $N \leq 64$, we are guaranteed that no two sequences
hash to the …
- 2,781
4
votes
Do Rabin Fingerprints have any advantages over CRC?
This is an expanded version of my comment above. At the top of page 135 of the paper cited by the OP, the construction of the cryptographic CRC is defined in the following words:
$\ldots$ for an …
- 2,781