
@oscarsm85309043 If you want to do this many times with a fixed modulus, then yes: you can precompute an inverse of n, or use Montgomery reduction. You can also do things more efficiently for n of special form, e.g. n = 2^k+1.
English
Fredrik Johansson
656 posts

@hypergeometer
fredrikj @ mathstodon Computer algebra & Arbitrary-precision arithmetic. Researcher at @Inria.
















