Analysis of the sliding window powering algorithm (Q1777287): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q592287 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Dimitrios Poulakis / rank | |||
Normal rank | |||
Revision as of 16:55, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the sliding window powering algorithm |
scientific article |
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
