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, the SSW reduces the average number of nonzero digits in a number or reduces the amount of pre-comput...
Gespeichert in:
| Veröffentlicht in: | Electronics letters Jg. 36; H. 23; S. 1 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Stevenage
John Wiley & Sons, Inc
09.11.2000
|
| Schlagworte: | |
| ISSN: | 0013-5194, 1350-911X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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, the 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. |
|---|---|
| Bibliographie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0013-5194 1350-911X |