Analysis of the sliding window powering algorithm
type: Item
instance of: scholarly article
title: Analysis of the sliding window powering algorithm
zbMATH Open document ID: 1066.11056
author: Henri Cohen
published in: Journal of Cryptology
publication date: 2005-05-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11Y40
zbMATH DE Number: 2168097
zbMATH Keywords: binary powering
zbMATH Keywords: addition chain
zbMATH Keywords: window method
zbMATH Keywords: elliptic curve
reviewed by: Dimitros Poulakis
MaRDI profile type: Publication
full work available at URL: s00145-004-0218-8
OpenAlex ID: W2041164068
DOI: 10.1007/S00145-004-0218-8
description: scientific article; zbMATH DE number 2168097