A Fast Modular Reduction Method.
Zhengjun Cao, Ruizhong Wei, Xiaodong Lin · 2014
We put forth a lookup-table-based modular reduction method which partitions the binary string of an integer to be reduced into blocks according to its runs. Its complexity depends on the amount of runs in the binary string. We show that the new reduction is almost twice as fast as the popular Barrett’s reduction, and provide a thorough complexity analysis of the method.