Analysis of the variable length nonzero window method for exponentiation

DOI10.1016/S0898-1221(99)00084-XzbMATH Open0935.94022MaRDI QIDQ1963003FDOQ1963003

Authors: Yanyan Li 

Publication date: 20 January 2000

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

Recommendations

• Analysis of sliding window techniques for exponentiation
• Some results on variable exponent analysis
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Variable-Precision Exponential Evaluation
• scientific article
• A Survey of Fast Exponentiation Methods
• Error analysis of two algorithms for the computation of the matrix exponential
• Computing exponential for iterative splitting methods: algorithms and applications
• Analysis approximate factorization in iteration methods
• Exponential Taylor methods: analysis and implementation

zbMATH Keywords

addition chainexponentiationmodular exponentiationRSA cryptosystemvariable length nonzero window method

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Modular Multiplication Without Trial Division
• Analysis of sliding window techniques for exponentiation
• Title not available (Why is that?)
• Computing Sequences with Addition Chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• New Modular Multiplication Algorithms for Fast Modular Exponentiation

Cited In (2)

• Analysis of the sliding window powering algorithm
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm

Uses Software

• GAP

This page was built for publication: Analysis of the variable length nonzero window method for exponentiation

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