Welcome to the resource topic for 2014/040
Title:
A Fast Modular Reduction Method
Authors: Zhengjun Cao, Ruizhong Wei, Xiaodong Lin
Abstract: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.
ePrint: https://eprint.iacr.org/2014/040
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .