Re: Java encryption implementation

From: Lars Schoening (lars_at_newdarkness.com)
Date: 11/28/05 

Date: Mon, 28 Nov 2005 21:08:24 +0100

> Underlined: The generator he proposed.

for n = 1 to 2^100000000

would take some billions of years to check by computations. If I'm not
totally wrong there is about 10^125 processes which happened in the
whole universe since the big bang, which is a considerable ammount more
then 2^100000000, not to forget that this would require an 11 Megabyte
integer datatype.