Analysis of the sliding window powering algorithm
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.
scientific article; zbMATH DE number 2168097