One appliction of this new reduction algorithm might be for computing a^b mod c when a is small.
When using Montgomery representaton for such bases, a^1, a^3, ... will become log(c) bits large. We could save lots of time by keeping many such a powers limb sized. -- Torbjörn _______________________________________________ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
