International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 15 January 2014

Zhengjun Cao, Ruizhong Wei, Xiaodong Lin
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.