[Jprogramming] Precision of modular multiplication of quite large numbers

[Raul Miller]

On Mon, May 8, 2017 at 4:43 AM, 'Mike Day' via Programming
<programming at jsoftware.com> wrote:
> Is there a better way to do modulus multiply with largish arguments?

Hypothetically speaking, you might be able to do something based on
http://code.jsoftware.com/wiki/Essays/FFT

I hope this helps,

-- 
Raul