Analysis of the sliding window powering algorithm

DOI10.1007/s00145-004-0218-8zbMath1066.11056OpenAlexW2041164068MaRDI QIDQ1777287

Henri Cohen

Publication date: 13 May 2005

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-004-0218-8

zbMATH Keywords

elliptic curveaddition chainwindow methodbinary powering

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Minimality and other properties of the width-𝑤 nonadjacent form ⋮ On the minimal Hamming weight of a multi-base representation ⋮ How to compute modular exponentiation with large operators based on the right-to-left binary algorithm ⋮ Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic ⋮ Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves

This page was built for publication: Analysis of the sliding window powering algorithm