Computing Sequences with Addition Chains
From MaRDI portal
Publication:3912017
DOI10.1137/0210047zbMath0462.68021OpenAlexW1993204154WikidataQ55953254 ScholiaQ55953254MaRDI QIDQ3912017
Benton L. Leong, Ravi Sethi, Peter J. Downey
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210047
Related Items (36)
Summing up function values in parallel: A complexity analysis ⋮ Efficient computation of addition chains ⋮ Efficient implementation of algorithms for approximate exponentiation ⋮ Mechanically proving termination using polynomial interpretations ⋮ Computing special powers in finite fields ⋮ Improved generation of minimal addition chains ⋮ Towards minimal addition chains using ant colony optimisation ⋮ On some measures of complexity of finite abelian groups ⋮ Some properties of vectorial addition chains† ⋮ On Addition Chains1 ⋮ On-line evaluation of powers using Euclid's algorithm ⋮ On the construction of short addition-subtraction chains and their applications ⋮ A new strategy for generating shortest addition sequences ⋮ Star reduction among minimal length addition chains ⋮ Analysis of the variable length nonzero window method for exponentiation ⋮ A study of some addition chain problems ⋮ A method for computing Lucas sequences ⋮ On a generalization of addition chains: addition-multiplication chains ⋮ Arithmetic Expression Construction. ⋮ How to compute modular exponentiation with large operators based on the right-to-left binary algorithm ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Approximability of minimum AND-circuits ⋮ Binary Addition Chain on EREW PRAM ⋮ Shorter addition chain for smooth integers using decomposition method ⋮ Short addition sequences for theta functions ⋮ Fast Exponentiation Using Data Compression ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Comparing the computational complexity of monomials and elements of finite abelian groups ⋮ Parallel computation of the multi-exponentiation for cryptosystems ⋮ Efficient algorithms for speeding up the computations of elliptic curve cryptosystems ⋮ 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: Computing Sequences with Addition Chains
