Re: Good enough for crypto?

Scott Wilber wrote:

>The Mersenne Twister followed by our infinitely recursive,
>multiple-feedback shift register (IRMFSR) stirring function produces
>sequences that have passed all our tests cumulative to 10's of
>trillions of bits. (By the way, NO other generator has passed our
>tests so far)
>

I don't know what "pass" means, but I just fed 2.20E+9 bits of the following
into your tests.    Got a 29.0+ (whatever that means)..

10 p=2^35-31
20 i=0
30 n=1
40 s=0
50 n=p-1-((p*i-1)@n)
60 i=i+1
70 s=(s+n\256)@65536
80 random16bits=s
90 goto 50

[EMAIL PROTECTED] mod b  ([EMAIL PROTECTED], [EMAIL PROTECTED])
a\b==a div b   (6\2=3, 10\3=3)

Good enough for crypto?  Hardly.  Good enough to "pass" your tests? Probably. 
Let you know when I get to 40+...  

Problems:  (1) show p is prime iff n=1 for some i>0 and (2) find the period of
n[i].  Have fun!

rich