Analysis of multi-exponentiation algorithm using binary signed-digit representations (Q4924256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of multi-exponentiation algorithm using binary signed-digit representations |
scientific article; zbMATH DE number 6168950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of multi-exponentiation algorithm using binary signed-digit representations |
scientific article; zbMATH DE number 6168950 |
Statements
ANALYSIS OF MULTI-EXPONENTIATION ALGORITHM USING BINARY SIGNED-DIGIT REPRESENTATIONS (English)
0 references
31 May 2013
0 references
complex arithmetic
0 references
multi-exponentiation
0 references
binary signed-digit (BSD) representation
0 references
computational efficiency
0 references
0.8633599281311035
0 references
0.8095880746841431
0 references
0.8053585886955261
0 references
0.7988739013671875
0 references
0.769310474395752
0 references
