IPG - newest release of the ABC Encryption Algorithms (fwd)

[Mike McNally]

John Pettitt wrote:
> /* the arrays b,c are filled in from tables of smallish primes supplied
> by IPG using 'random' numbers supplied by IPG to select the primes (and the
> order of same).  since all the values are > 8 bits I've assumed a,b,c = int.
> a[] is filled with 13568 + an 8 bit 'random' number.  (13568 = 0x3500 which
> gets ANDed with the seed value)
> */

One tangerine-flavord Starburst to the first cypherpunk who can give
a rough estimate for the results of the sub-expression:

	(random() & 0xff) & 0x3500


______c_____________________________________________________________________
Mike M Nally * Tiv^H^H^H IBM * Austin TX    * pain is inevitable  
       m5 at tivoli.com * m101 at io.com          *
      <URL:http://www.io.com/~m101>         * suffering is optional