hi,
--- [EMAIL PROTECTED] wrote:
On 22 Apr 2002 at 0:08, Ben Laurie wrote:
Oh surely you can do better than that - making it
hard to guess the seed
is also clearly a desirable property (and one that
the square root rng
does not have).
U can choose any arbitrary seed(greater than 100
gfgs pedo wrote:
hi,
--- [EMAIL PROTECTED] wrote:
On 22 Apr 2002 at 0:08, Ben Laurie wrote:
Oh surely you can do better than that - making it
hard to guess the seed
is also clearly a desirable property (and one that
the square root rng
does not have).
U can choose any
Ben Laurie wrote:
gfgs pedo wrote:
hi,
--- [EMAIL PROTECTED] wrote:
On 22 Apr 2002 at 0:08, Ben Laurie wrote:
Oh surely you can do better than that - making it
hard to guess the seed
is also clearly a desirable property (and one that
the square root rng
does not
- Original Message -
From: gfgs pedo [EMAIL PROTECTED]
Oh surely you can do better than that - making it
hard to guess the seed
is also clearly a desirable property (and one that
the square root rng
does not have).
U can choose any arbitrary seed(greater than 100 bits
as
hi,
I get the point.Thanx for all the replies.
regards Data.
--- Joseph Ashwood [EMAIL PROTECTED] wrote:
- Original Message -
From: gfgs pedo [EMAIL PROTECTED]
Oh surely you can do better than that - making
it
hard to guess the seed
is also clearly a desirable
- Original Message -
From: gfgs pedo [EMAIL PROTECTED]
Oh surely you can do better than that - making it
hard to guess the seed
is also clearly a desirable property (and one that
the square root rng
does not have).
U can choose any arbitrary seed(greater than 100 bits
as
At 11:22 AM 4/21/02 +0200, Eugen Leitl wrote:
I disagree here somewhat. Cryptography ttbomk doesn't have means of
construction of provably strong PRNGs, especially scalable ones, and
with
lots of internal state (asymptotically approaching one-time pad
properties), and those which can be mapped
On 21 Apr 2002 at 10:00, Major Variola (ret) wrote:
At 11:22 AM 4/21/02 +0200, Eugen Leitl wrote:
I disagree here somewhat. Cryptography ttbomk doesn't have means of
construction of provably strong PRNGs, especially scalable ones, and
with
lots of internal state (asymptotically
At 11:22 AM 4/21/02 +0200, Eugen Leitl wrote:
I disagree here somewhat. Cryptography ttbomk doesn't have means of
construction of provably strong PRNGs, especially scalable ones, and
with
lots of internal state (asymptotically approaching one-time pad
properties), and those which can be mapped
[EMAIL PROTECTED] wrote:
On 21 Apr 2002 at 10:00, Major Variola (ret) wrote:
At 11:22 AM 4/21/02 +0200, Eugen Leitl wrote:
I disagree here somewhat. Cryptography ttbomk doesn't have means of
construction of provably strong PRNGs, especially scalable ones, and
with
lots of
10 matches
Mail list logo
