.png){kind=icon}
Return
Optimal left-to-right binary signed-digit recoding
.png){kind=icon}
PRE
AI
DOI：10.1109/12.863044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper describes new methods for producing optimal binary signed-digit representations. This can be useful in the fast computation of exponentiations. Contrary to existing algorithms, the digits are scanned from left to right (i.e., from the most significant position to the least significant position). This may lead to better performances in both hardware and software.
Keywords:
computer arithmetic
converter
signed-digit representation
redundant number representation
SD2 left-to-right recoding
canonical/minimum-weight/nonadjacent form
exponentiation
elliptic curves
smart-cards
cryptography
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveRestorative mowing on an abandoned semi‐natural meadow: short‐term and predicted long‐term effects
PREAI
ShareSaveRemembering to execute deferred tasks in simulated air traffic control: The impact of interruptions.
OAAI
OAAIShareSaveShareSaveShareSave
View more