Analysis of the sliding window powering algorithm

DOI10.1007/S00145-004-0218-8MaRDI QIDQ1777287zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Analysis of the variable length nonzero window method for exponentiation
• Analysis of sliding window techniques for exponentiation
• scientific article; zbMATH DE number 2162686
• Fast elliptic curve point multiplication based on window non-adjacent form method
• scientific article; zbMATH DE number 2085203

Cited in

(5)

• Minimality and other properties of the width-𝑤 nonadjacent form
• On the minimal Hamming weight of a multi-base representation
• Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• Improved precomputation scheme for scalar multiplication on elliptic curves

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777287)