Re: "All random number generators eventually exhibit periodicity"?????

From: Paul Rubin (//phr.cx_at_NOSPAM.invalid)
Date: 07/22/04

Next message: David C. Ullrich: "Re: Surrogate factoring, reasons for my concerns"
Previous message: Paul Rubin: "Re: "All random number generators eventually exhibit periodicity"?????"
In reply to: Paul Rubin: "Re: "All random number generators eventually exhibit periodicity"?????"
Next in thread: Douglas A. Gwyn: "Re: "All random number generators eventually exhibit periodicity"?????"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Date: 22 Jul 2004 03:43:29 -0700

Paul Rubin <http://phr.cx@NOSPAM.invalid> writes:
> I believe that the sequence
>
> md5("xyz1")...

Ehhh, md5 is unsuitable since it doesn't work for inputs longer than
2**64 bits. But you get the idea.

Next message: David C. Ullrich: "Re: Surrogate factoring, reasons for my concerns"
Previous message: Paul Rubin: "Re: "All random number generators eventually exhibit periodicity"?????"
In reply to: Paul Rubin: "Re: "All random number generators eventually exhibit periodicity"?????"
Next in thread: Douglas A. Gwyn: "Re: "All random number generators eventually exhibit periodicity"?????"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Relevant Pages

Re: MD5 collisions
... MD5 for str_a and y is the padding used by MD5 for str_b, ... str_c for any bit sequence str_c. ... The string 'the quick brown fox jumps over the lazy dog' hashes to ... If it's a feasible task, is there any software around that already achieves ...
(sci.crypt)
Re: MD5 collisions
... MD5 for str_a and y is the padding used by MD5 for str_b, ... str_c for any bit sequence str_c. ... brute force is the only way. ... I imagine that fear of use for nefarious purposes ...
(sci.crypt)