Re: PGP
- From: David Eather <eather@xxxxxxxxxx>
- Date: Mon, 12 May 2008 08:38:07 +1000
Tim Smith wrote:
In article <4YKdnbP4xoAE0bvVnZ2dnUVZ_o3inZ2d@xxxxxxxxxxxxx>,Doh! Yes of course.
David Eather <eather@xxxxxxxxxx> wrote:
--- In PGP, what is the probability that a user with N public keysSub Key ID is 32 bits long, so the answer is 2^16 or 65536.
will have at least one duplicate key ID?
Uhm...should the probability be somewhere in [0,1]? :-)
If you have N keys, out of a total possible M keys, the chance of a match is
P = 1 - ((M-1)/M * (M-2)/M * ...(M-(N-1))/M)
which would simplify into something much prettier - maybe this (no warranty expressed or implied - going from memory with no sleep for 30hrs). On the plus side, if I am wrong someone will correct me.
M!
P = 1 - ----------------
(M-(N-1))! x M^N
.
- Prev by Date: Re: RSA ecnryption confusion
- Next by Date: To all parents
- Previous by thread: Re: PGP
- Next by thread: Lents busted by Operation Sudden Fall
- Index(es):
Relevant Pages
|
|