Analysis of sliding window techniques for exponentiation

DOI10.1016/0898-1221(95)00153-PzbMath0835.68057MaRDI QIDQ1903214

Çetin Kaya Koç

Publication date: 26 November 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

Markov chainexponentiationsliding window techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

Efficient request-based comparable encryption scheme based on sliding window method ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ Analysis of the variable length nonzero window method for exponentiation ⋮ Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques ⋮ Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques ⋮ How to compute modular exponentiation with large operators based on the right-to-left binary algorithm ⋮ Securing RSA against Fault Analysis by Double Addition Chain Exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A public key cryptosystem and a signature scheme based on discrete logarithms
• High-radix and bit recoding techniques for modular exponentiation
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Analysis of sliding window techniques for exponentiation