Re: Please help me to find a mistake here

matt271829-news@xxxxxxxxxxx wrote:
Anyway, FWIW, making some simplifying assumptions (that seem entirely
reasonable since 71 is so much smaller than 2^32), I make the
probability of event E equal to about 1.76E-10. I think this is
slightly different from James Waldby's answer. I did it in a slightly
more elaborate way, but with these particular numbers I would have
thought the answers should differ by only an imperceptible amount. I'm
not sure at the moment why the answers differ as much as they do, but
if I get a following wind I might try to pick through it and figure it
out.
1.76E-10 sounds just perfect! it passes reality check and is very well
aligned with my experiment (taking your numbers gives us about 0.58
probability that event E occurs at least once per 2^32 attempts).
Could you post your formulas, please? (with some explanations if
possible ;-).

-Valery.
http://www.harper.no/valery

.

Relevant Pages

  • Re: Please help me to find a mistake here
    ... probability of event E equal to about 1.76E-10. ... slightly different from James Waldby's answer. ... thought the answers should differ by only an imperceptible amount. ... Using this second method I get Pr= 1.7611E-10, ...
    (sci.math)
  • Re: SHA1 broken
    ... >> probability of occuring above a given threshold. ... When the diff occurs only a limited subset of keys are possible. ... for all p then the attack can't work. ...
    (sci.crypt)
  • Re: minimum Hamming distance among random bit vectors
    ... and of "distinct vectors" to refer to vectors in distinct entries. ... With Xij denoting random unbiased independent bits, ... pis the probability that there exists indexes r s ... there are two which differ by at most d bits. ...
    (sci.crypt)
  • Re: minimum Hamming distance among random bit vectors
    ... > Let pbe the probability that among a set of ... > n ramdom vectors of b bits, ... > vectors which differ by at most d bits out of b. ... > So far I fail to find a workable technique to exactly compute ...
    (sci.crypt)
  • Re: How much is Alice worth to Bob?
    ... >> X just about as efficiently without knowing S as if she did know S. ... >cases differ not only in Alice's knowledge of S, ... the error probability in your protocol can ...
    (sci.crypt)