[67289] in Cypherpunks
RE: DESCrack keyspace partitioning
daemon@ATHENA.MIT.EDU (jbugden@smtplink.alis.ca)
Fri Oct 4 10:23:06 1996
From: jbugden@smtplink.alis.ca
Date: Fri, 04 Oct 96 09:58:20 EST
To: "geeman@best.com" <geeman@best.com>
Cc: cypherpunks@toad.com
"geeman@best.com" <geeman@best.com> wrote:
>(P)RNG's just aren't that likely to produce a key of 010101010.....
nor 001100110011... etc etc and I have been thinking about how one might
formalize and exploit this randomness property to increase the probability =
of
finding the key sooner.
...
>Any thoughts here?
Suppose we have a function f() that randomly chooses an integer between 1 a=
nd
100 such that each integer in the range is equally likely to be selected on=
each
call. If we call f() 6 times, each time noting whether the result is even or
odd, which of the following sequences is more likely?
Even Even Even Even Even Even
Even Odd Odd Even Even Odd
If you picked the second sequence as more likely, you are like most people =
who
responded to similar questions in a classic study of cognitive biases [1]. =
The
two sequences actually have an identical probability of occuring, and, in f=
act,
all sequences of six outcome are EQUALLY probable.
This example illustrates the representativeness bias, in which we mistakenly
suspect the global characteristics of a process to be represented locally i=
n a
specific sequence[2].
Ciao,
James
1. Kahnman, D., and Tversky, A. Subjective probability: A judgement or
representativeness. Cognit. Psych. 3 (1972) 430-454
2. Stacy, Webb and MacMillian, Jean, Cognitive Bias in Software Development.
Communications of the ACM June 1995, 57-63
