On the Evaluation of Powers
From MaRDI portal
Publication:4091445
DOI10.1137/0205008zbMATH Open0326.68025OpenAlexW2062429446MaRDI QIDQ4091445FDOQ4091445
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
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
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Algorithms in computer science (68W99)
Cited In (23)
- Polynomial modular product verification and its implications
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm
- Random Order m-ary Exponentiation
- Constructing elliptic curves over finite fields with prescribed torsion
- Some active attacks on fast server-aided secret computation protocols for modular exponentiation
- Shorter addition chain for smooth integers using decomposition method
- On the computation complexity of the systems of finite abelian group elements
- Title not available (Why is that?)
- Delegating a product of group exponentiations with application to signature schemes
- Symbolic treatment of geometric degeneracies
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- On-line evaluation of powers using Euclid's algorithm
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
- On Bellman's and Knuth's problems and their generalizations
- 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
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
- Approximation of grammar-based compression via recompression
- A duality in space usage between left-to-right and right-to-left exponentiation
- Complexity of computation in finite fields
- Efficient computation of addition chains
- Computing special powers in finite fields
- Parallel computation of the multi-exponentiation for cryptosystems
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)
