At 12:28 PM 8/25/00 -0400, Marcel Popescu wrote:
>X-Loop: openpgp.net
>From: "David Honig" <[EMAIL PROTECTED]>
>
>> You could also use Shannon's formula directly to compute informational
>> quantity. This might work better for short strings.
>
>Can you give me more info on that one?
I think John
X-Loop: openpgp.net
From: "David Honig" <[EMAIL PROTECTED]>
> You could also use Shannon's formula directly to compute informational
> quantity. This might work better for short strings.
Can you give me more info on that one?
> More appropriate for testing RNG outputs: Ueli Maurer has a
> comp
On Thu, Aug 24, 2000 at 09:53:05PM -0400, Adam Back wrote:
>
>
> Tim writes:
> > At 3:08 PM -0400 8/24/00, Marcel Popescu wrote:
> > >
> > >Speaking of which - does anybody have any hints on how to determine the
> > >entropy of an input string?
> > > [...]
>
> Traditionally CPRNGs pass this p
At 06:26 PM 8/24/00 -0400, Tim May wrote:
>At 3:08 PM -0400 8/24/00, Marcel Popescu wrote:
>>
>>Speaking of which - does anybody have any hints on how to determine the
>>entropy of an input string? [Needed in Yarrow, and so far I don't know how
>>to do it - my implementation multiplies the length
X-Loop: openpgp.net
From: "Tim May" <[EMAIL PROTECTED]>
> >Speaking of which - does anybody have any hints on how to determine the
> >entropy of an input string? [Needed in Yarrow, and so far I don't know
how
> >to do it - my implementation multiplies the length of the input string
(in
> >bits) w
X-Loop: openpgp.net
From: "Adam Back" <[EMAIL PROTECTED]>
> Ideally you want random driver level support (like /dev/[u]random on
> linux and some unixes) on as many OSes as possible.
I don't know how to write drivers in Windows, especially in Delphi (I don't
even think that's possible - in Delph
