From e421f2832199c63e30b61f79d4306ba44e6c8ec9 Mon Sep 17 00:00:00 2001 From: davidsarah <> Date: Sun, 11 Oct 2009 14:00:05 +0000 Subject: [PATCH] correction to effective hash length for accidental collisions [Imported from Trac: page NewCaps/WhatCouldGoWrong, version 30] --- NewCaps/WhatCouldGoWrong.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/NewCaps/WhatCouldGoWrong.md b/NewCaps/WhatCouldGoWrong.md index 699e59c..889077b 100644 --- a/NewCaps/WhatCouldGoWrong.md +++ b/NewCaps/WhatCouldGoWrong.md @@ -29,7 +29,7 @@ where *k* = bitlength(*K1*), *r* = bitlength(*R*), *s* = bitlength(*S*), *t* = 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 -4. See the probability table at , for hash length *s*+*t*. +4. See the probability table at . The effective hash length is approximately min(*s*,*r*)+*t* bits. 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 explicit formulae for this?)