At 10:18 AM 4/25/02 -0700, Tim May wrote:
On Thursday, April 25, 2002, at 07:45 AM, Major Variola (ret) wrote:
Predictability gets much worse if one of the walls of a pool-table is
curved,
then the uncertainty in a perfectly-round ball's momentum is
magnified after reflection, compared to a
Jim Choate [EMAIL PROTECTED] wrote:
But that changes the game in the middle of play, the sequence of digits
in pi is fixed, not random. You can't get a random number from a constant.
Otherwise it wouldn't be a constant.
PRNG output is fixed/repeatable too - that is a properly you *want* from a
On Wed, 24 Apr 2002, David Howe wrote:
Jim Choate [EMAIL PROTECTED] wrote:
But that changes the game in the middle of play, the sequence of digits
in pi is fixed, not random. You can't get a random number from a constant.
Otherwise it wouldn't be a constant.
PRNG output is
Sampo Syreeni [EMAIL PROTECTED] wrote:
Aren't there dedicated avalanche diodes available with low breakdown
voltages, precisely for this reason? I think they're used in applications
where zeners could be, except for higher breakdown current.
Sure. I was thinking of an IC design, in which
On Tue, 23 Apr 2002 [EMAIL PROTECTED] wrote:
--
Jim Choate wrote:
If you can't develop a RNG in software (ie you'd be in a
state of sin), what makes you think you can do it using
-only- digital gates in hardware? You can't.
James A. Donald:
Classic Choatian physics.
On 24 Apr 2002 at 17:41, David Howe wrote:
Maybe for you, I sure as hell wouldn't use it either as a key or as a
seed into a known hashing/whiting algorithm.
its probably a better (if much slower) stream cypher than most currently in
use; I can't think of any that have larger than a 256
--
Joseph Ashwood
Because with a pRNG we can sometimes prove very important
things, while with a RNG we can prove very little (we can't
even prove that entropy actually exists, let alone that we
can collect it).
James A. Donald:
Don't be silly. Of course we know that
On Tue, 23 Apr 2002, Trei, Peter wrote:
Exactly what is the Choatian definition of a PRNG which requires
it to repeat, anyway?
Wrong question, the -right- questions is...
What is -random-?
It means unpredictable, this means unrepeatable. If it repeats then it
-must- be predictable; that
On Sunday, April 21, 2002, at 09:53 PM, Joseph Ashwood wrote:
- Original Message -
From: [EMAIL PROTECTED]
To: Tim May [EMAIL PROTECTED]; Eugen Leitl [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Sunday, April 21, 2002 1:33 PM
Subject: Re: Two ideas for random number generation
- Original Message -
From: [EMAIL PROTECTED]
To: Tim May [EMAIL PROTECTED]; Eugen Leitl [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Sunday, April 21, 2002 1:33 PM
Subject: CDR: Re: Two ideas for random number generation
Why would one want to implement a PRNG in silicon, when one can
On Mon, 22 Apr 2002, Tim May wrote:
What real-life examples can you name where Gbit rates of random digits
are actually needed?
Multimedia streams, routers. If I want to secure a near-future 10 GBit
Ethernet stream with a symmetric cypher for the duration of a few years
(periodic rekeying
On Sun, 21 Apr 2002 [EMAIL PROTECTED] wrote:
Why would one want to implement a PRNG in silicon, when one can
easily implement a real RNG in silicon?
Both applications are orthogonal. PRNG != entropy.
And if one is implementing a PRNG in software, it is trivial to
have lots of internal
- Original Message -
From: Eugen Leitl [EMAIL PROTECTED]
On Mon, 22 Apr 2002, Tim May wrote:
What real-life examples can you name where Gbit rates of random digits
are actually needed?
Multimedia streams, routers. If I want to secure a near-future 10 GBit
Ethernet stream with a
- 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
--
Tim May:
As a meta-point, the world is not in short supply of lots of
good RNGs, ranging from Johnson noise detectors to very strong
Blum-Blum-Shub generators. The interesting stuff in crypto
lies in other places.
Eugen Leitl
I disagree here somewhat. Cryptography ttbomk
[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
For the start, before deeper analysis, it would be a good idea to run Diehard
on the output, just to check for the obvious problems.
=
end
(of original message)
Y-a*h*o-o (yes, they scan for this) spam follows:
Yahoo! Games - play chess, backgammon, pool and more
http://games.yahoo.com/
18 matches
Mail list logo
