On vectorial addition chains

DOI10.1016/0196-6774(81)90003-1MaRDI QIDQ3919076zbMATH OpenOpenAlexFDO

Authors J. Olivos

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

zbMATH Keywords

computation of monomials

Mathematics Subject Classification ID

Sequences and sets (11B99) Additive number theory; partitions (11P99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(17)

• Speeding up the computations of elliptic curves cryptoschemes
• On some measures of complexity of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations
• Addition chains, vector chains, and efficient computation
• Relation between two measures of the computation complexity for systems of monomials
• Memory-saving computation of the pairing final exponentiation on BN curves
• Faster hashing to \({\mathbb G}_2\)
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Fast Hashing to G 2 on Pairing-Friendly Curves
• On Addition Chains¹
• Some properties of vectorial addition chains^†
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
• A new strategy for generating shortest addition sequences
• Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k=5,7
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• Mechanically proving termination using polynomial interpretations

This page was built for publication: On vectorial addition chains

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