Question: Why do I come across a numeric overflow in (m^e) mod n


I'm experimenting the RSA encryption algorithm and in one example, I need to calculate (m^e) mod n where :




and I receive : Error, numeric exception: overflow

Even though these are large numbers, modular arithmetic algorithms should be able to deal with that.

Why is it not the case ?

NB : One of the mathApps in the category Computer Science is "RSA Encryption" and proves to be fairly comfortable with such large numbers, no overflow!

Please Wait...