On the Evaluation of Powers

DOI10.1137/0205008MaRDI QIDQ4091445zbMATH OpenOpenAlexFDO

Authors Andrew Chi-Chih Yao

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205008

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Algorithms in computer science (68W99)

Recommendations

• On Evaluation of Powers
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
• On-line evaluation of powers using Euclid's algorithm
• scientific article; zbMATH DE number 609921
• Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains

Cited in

(23)

• Some active attacks on fast server-aided secret computation protocols for modular exponentiation
• A duality in space usage between left-to-right and right-to-left exponentiation
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Faster cofactorization with ECM using mixed representations
• Approximation of grammar-based compression via recompression
• Constructing elliptic curves over finite fields with prescribed torsion
• Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm
• Shorter addition chain for smooth integers using decomposition method
• Symbolic treatment of geometric degeneracies
• Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• Complexity of computation in finite fields
• Delegating a product of group exponentiations with application to signature schemes
• Parallel computation of the multi-exponentiation for cryptosystems
• Efficient computation of addition chains
• On-line evaluation of powers using Euclid's algorithm
• On Bellman's and Knuth's problems and their generalizations
• Polynomial modular product verification and its implications
• On the computation complexity of the systems of finite abelian group elements
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• Random Order m-ary Exponentiation
• Computing special powers in finite fields
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems

This page was built for publication: On the Evaluation of Powers

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