Re: Java encryption implementation

> Either you develop a really secure PRNG, which I highly doubt for someone
> who claims and proofs to be a n00b, or you implement a known good PRNG. And
> then, you would just reimplement something that has already been
> implemented in the default J2SE runtime.

Ok, I guess I'm just making another LFSR with this one:

x(n+1) = (xn 275604541 - 2n + cn) mod 2^64
where c is the byte at position n

Im checking it with cn=0 right now and it didn't repeat til n=2^32 yet,
not sure if that makes the thing any good...

Sorry about the fullquotes, didn't mean to annoy.
Received on Sat Dec 3 04:20:05 2005