**Duality between Multiplication and Modular Reduction**

*Wieland Fischer and Jean-Pierre Seifert*

**Abstract: **This paper presents a duality between the classical optimally speeded up multiplication algorithm
and some "fast" reduction algorithm.
For this, the multiplier is represented by the unique signed digit representation with minimal Hamming
weight using Reitwiesner's multiplier recoding algorithm.
In fact, the present paper proves that this optimal multiplier recoding technique naturally translates
into a canonical modular reduction technique.
The other direction is shown as well.
Thus, the resulting reduction algorithm is optimal with respect to its average-time complexity as well.
Besides these two new results, our proof of the transfer-theorem serves another interesting purpose:
The reason that the considered reduction algorithm from \cite{Sedlak} is so unknown
might lie in the fact that it is rather un-intuitive and no proper understanding was available so far.
Therefore, our proper mathematical derivation/explanation solves this lack of understanding.

**Category / Keywords: **implementation / Modular reduction

**Date: **received 10 Mar 2005

**Contact author: **Jean-Pierre Seifert at intel com

**Available format(s): **Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

**Version: **20050316:050720 (All versions of this report)

**Short URL: **ia.cr/2005/078

[ Cryptology ePrint archive ]