[cryptography] urandom vs random

grarpamp grarpamp at gmail.com
Tue Aug 20 18:12:45 EDT 2013

On Tue, Aug 20, 2013 at 5:58 PM, Natanael <natanael.l at gmail.com> wrote:
> For all you know the PRNG could be doing nothing more
> than doing SHA256 of a fixed value plus a counter

Yes, and in an application where even that trivial design would serve
to fit some use, testing the apparent randomness.of proposed hash
functions against themselves, and proof sampling operational matters,
would still be useful to do.

To that end, here is one tool that was forwarded off list...

More information about the cryptography mailing list