Analysis of the sliding window powering algorithm (Q1777287): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00145-004-0218-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041164068 / rank | |||
Normal rank | |||
Latest revision as of 00:30, 20 March 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
