On vectorial addition chains
From MaRDI portal
Publication:3919076
DOI10.1016/0196-6774(81)90003-1zbMath0466.68034OpenAlexW1974049704MaRDI QIDQ3919076
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(81)90003-1
Analysis of algorithms and problem complexity (68Q25) Additive number theory; partitions (11P99) Sequences and sets (11B99)
Related Items (16)
Faster Hashing to ${\mathbb G}_2$ ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Mechanically proving termination using polynomial interpretations ⋮ Speeding up the computations of elliptic curves cryptoschemes ⋮ On some measures of complexity of finite abelian groups ⋮ Some properties of vectorial addition chains† ⋮ On Addition Chains1 ⋮ A new strategy for generating shortest addition sequences ⋮ Addition chains, vector chains, and efficient computation ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Speeding up the computations on an elliptic curve using addition-subtraction chains ⋮ Relation between two measures of the computation complexity for systems of monomials ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ 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 vectorial addition chains
