Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
From MaRDI portal
Publication:3747718
DOI10.2307/2007998zbMATH Open0608.68027OpenAlexW1980003318MaRDI QIDQ3747718FDOQ3747718
Authors: Daniel McCarthy 
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2007998
Recommendations
- scientific article; zbMATH DE number 1088932
- scientific article; zbMATH DE number 1950620
- Efficient implementation of algorithms for approximate exponentiation
- Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
- Efficient computation of addition chains
- Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- scientific article; zbMATH DE number 2085203
- scientific article; zbMATH DE number 177037
- Faster scalar multiplication algorithm based on addition chain
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cited In (10)
- Title not available (Why is that?)
- Analysis of sliding window techniques for exponentiation
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Signed bits and fast exponentiation
- On-line evaluation of powers using Euclid's algorithm
- Computing When Multiplications Cost Nothing
- On the Evaluation of Powers
- On the construction of short addition-subtraction chains and their applications
- Efficient implementation of algorithms for approximate exponentiation
- Efficient computation of addition chains
This page was built for publication: Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747718)
