Re: Testing a Pseudo-Random Generator

From: Anon <null@xxxxxxxx>
Date: Thu, 28 Apr 2005 08:11:54 +1000

Reef Fish wrote:
<snip>

They both LOOK random.

Good pseudorandom number generators produce sequences that are
virtually
indistinguishable from those generated by a truly random process.

<snip>

The general definition for a pseudorandom generator is that there does not exist a polynomial distinguisher, that is, an algorithm which runs in polynomial time and space w.r.t. the number of bits generated by the generator.

One of the criteria for stream ciphers is that they behave as a pseudorandom generator.

Ursus
.

References:
- Testing a Pseudo-Random Generator
  - From: \"Luis A. Afonso\"
- Re: Testing a Pseudo-Random Generator
  - From: Reef Fish

Prev by Date: Re: Gian-Carlo Rota's "Twelve problems in probability no one likes to bring up."
Next by Date: Re: Testing a Pseudo-Random Generator
Previous by thread: Re: Testing a Pseudo-Random Generator
Next by thread: Re: Testing a Pseudo-Random Generator
Index(es):
- Date
- Thread

Relevant Pages

[PATCH] rcu: Fix sign bug making rcu_random always return the same sequence
... get_random_bytes into the state of its pseudorandom generator. ... struct rcu_random_state { ... * Crude but fast random-number generator. ...
(Linux-Kernel)
Re: [PATCH] rcu: Fix sign bug making rcu_random always return the same sequence
... get_random_bytes into the state of its pseudorandom generator. ... * Crude but fast random-number generator. ...
(Linux-Kernel)
Re: Weakness of Feistel ciphers
... How do I reconcile the above two statements? ... If you do need your generator to be cryptographically strong, ... to design your own pseudorandom generator, as it is easy to go wrong ... discussions of cryptography and related topics. ...
(sci.crypt)