Re: Is the computation of x=a(mod b) where a is 8*10^5 bit length positive interger and b is 80 bit length positive interger realistic?

On Sep 4, 7:31 am, challengerlee <lihui0...@xxxxxxxxx> wrote:
somebody saids it unrealistic, but i think it's practical, it just do
shift and subtract operation repeatly, with about 10^4 times. So, i
wonder others' opinions. Thanks very much!

Isthere any lib that i can use immediately for these large
integer operations?

This doesn't even cause a sweat these days.

1. GMP (license may be an issue, http://gmplib.org/)

2. libtommath (easier on the license, see: http://libtom.org/)

If you want to experiment, you can get pari (see: http://pari.math.u-bordeaux.fr/)
or purchase mathematica or maple or etc.

For comparison see: http://en.wikipedia.org/wiki/Comparison_of_computer_algebra_systems

Enjoy ~A


.

Relevant Pages