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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronics letters Ročník 36; číslo 23; s. 1
Hlavní autoři: Phillips, B J, Burgess, N
Médium: Journal Article
Jazyk:angličtina
Vydáno: Stevenage John Wiley & Sons, Inc 09.11.2000
Témata:
Algorithms
Digits
Multiplication
Reduction
Sliding
ISSN:0013-5194, 1350-911X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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