Signed sliding window algorithms for modulo multiplication

摘要

The signed sliding window (SSW) number system for accelerating long-wordlength modulo multiplication is introduced. Compared with the previously published unsigned sliding window (USW) number system, SSW reduces the average number of nonzero digits in a number or reduces the amount of pre-computation required. In addition, how USW and SSW can be combined advantageously with Montgomery's algorithm for modulo reduction is described.