Implement Barrett reduction and use it as default for `mulmod()` - Githubissues

nucypher / DarkIntegers.jl

A modulo arithmetic toolbox for integers and polynomials

https://nucypher.github.io/DarkIntegers.jl

GNU General Public License v3.0

7 stars 2 forks source link

Implement Barrett reduction and use it as default for `mulmod()` #18

Open fjarri opened 4 years ago

fjarri commented 4 years ago

Currently mulmod() uses divrem() which can be quite slow.