Big Integers in JavaScriptm'' uses secret p and q to be faster. P=c^d mod p Q=c^d mod q m''=((Q-P)*(p^-1) mod q)*p+P The library allows addition, subtraction, multiplication, division, exponentiation, and inverses modulo an arbitrary number. It has the extended Euclid algorithm, and can convert between bases up to base 95. It generates true prime numbers rather than probable primes. For Internet Explorer on a 1.8 GHz WinXP
