Analysis of the sliding window powering algorithm (Q1777287)
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 the sliding window powering algorithm |
scientific article; zbMATH DE number 2168097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the sliding window powering algorithm |
scientific article; zbMATH DE number 2168097 |
Statements
Analysis of the sliding window powering algorithm (English)
0 references
13 May 2005
0 references
Let \(G\) be a group, \(g\in G\) and \(N\) be a positive integer. The sliding window powering algorithm is used for the efficient computation of \(g^N\). The purpose of the paper under review is to analyze precisely the behavior of this algorithm. Moreover, this analysis is applied to the case of the group of an elliptic curve defined over a large finite prime field.
0 references
binary powering
0 references
addition chain
0 references
window method
0 references
elliptic curve
0 references
0.7018546462059021
0 references
0.6979958415031433
0 references
0.6918188333511353
0 references
