Currently it is super-slow, even streamlined from mod(MLUInt{N, T}, MLUInt{N, T}) (10x the times for BigInt), but it would be very useful for RNS decomposition (issue #12). Need to see if we can lift NTL or https://github.com/niekbouman/ctbignum implementation.
Currently it is super-slow, even streamlined from
mod(MLUInt{N, T}, MLUInt{N, T})(10x the times for BigInt), but it would be very useful for RNS decomposition (issue #12). Need to see if we can lift NTL or https://github.com/niekbouman/ctbignum implementation.