On the Evaluation of Powers
From MaRDI portal
Publication:4091445
DOI10.1137/0205008zbMath0326.68025OpenAlexW2062429446MaRDI QIDQ4091445
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
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Algorithms in computer science (68W99)
Related Items
A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation, Efficient computation of addition chains, Symbolic treatment of geometric degeneracies, Computing special powers in finite fields, Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography, Complexity of computation in finite fields, Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm, On-line evaluation of powers using Euclid's algorithm, On the computation complexity of the systems of finite abelian group elements, Constructing elliptic curves over finite fields with prescribed torsion, Approximation of grammar-based compression via recompression, Delegating a product of group exponentiations with application to signature schemes, On Bellman's and Knuth's problems and their generalizations, О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат, Low-cost addition-subtraction sequences for the final exponentiation in pairings, Faster cofactorization with ECM using mixed representations, Random Order m-ary Exponentiation, Shorter addition chain for smooth integers using decomposition method, Some active attacks on fast server-aided secret computation protocols for modular exponentiation, Parallel computation of the multi-exponentiation for cryptosystems, Polynomial modular product verification and its implications, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
