Re: Java encryption implementation

Lars Schoening wrote:

> for n = 1 to 2^100000000

Perhaps a better description would be (my Java is a bit rusty, but I
guess you can understand):

BigInt random()
 {
  static BigInt x(0);

  x=(x+1) % 2^100000000; //^ means power, not xor
  return x;
 }

> would take some billions of years to check by computations.

Perhaps NOW you can see the period is 2^100000000 ?
And that the generator is useless?

> not to forget that this would require
> an 11 Megabyte integer datatype.

No problem... it's just a proof-of-concept.

  Milan
Received on Sat Dec 3 04:20:15 2005