hash length for accidental collisions
[Imported from Trac: page NewCaps/WhatCouldGoWrong, version 16]
parent
15918a1423
commit
659092e8dc
|
@ -25,7 +25,7 @@ where *k* = bitlength(*K1*), *n* = bitlength(*R*), *t* = bitlength(*T*), *u* = b
|
||||||
|
|
||||||
3. *undeletion*: attacker makes a deleted file (for which it need not have had a read cap) accessible at its previous storage index, and readable by previous read caps
|
3. *undeletion*: attacker makes a deleted file (for which it need not have had a read cap) accessible at its previous storage index, and readable by previous read caps
|
||||||
|
|
||||||
4. See the probability table at <http://en.wikipedia.org/wiki/Birthday_Paradox> .
|
4. See the probability table at <http://en.wikipedia.org/wiki/Birthday_Paradox> , for hash length *s*+*t*.
|
||||||
|
|
||||||
5. Brute force costs assume a single-target attack that is expected to succeed with high probability. Costs will be lower for attacking multiple targets or for a lower success probability. (Should we give give explicit formulae for this?)
|
5. Brute force costs assume a single-target attack that is expected to succeed with high probability. Costs will be lower for attacking multiple targets or for a lower success probability. (Should we give give explicit formulae for this?)
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue