Calculating optimal addition chains

DOI10.1007/S00607-010-0118-8MaRDI QIDQ644848zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Neill Michael Clift

Publication date 7 November 2011

Published in Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00607-010-0118-8

zbMATH Keywords

optimizationsequencesexponentiationaddition chainsScholz-Brauer conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)

Recommendations

• Minimizing sums of addition chains
• Efficient computation of addition chains
• scientific article; zbMATH DE number 5968524
• Addition chains using continued fractions
• A Conjecture in Addition Chains Related to Scholz's Conjecture

Cites work

• scientific article; zbMATH DE number 3121508 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 697837 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• A Lower Bound for the Scholz-Brauer Problem
• A Note on the Scholz-Brauer Problem in Addition Chains
• A Survey of Fast Exponentiation Methods
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\)
• Efficient Generation of Minimal Length Addition Chains
• Integers with a small number of minimal addition chains
• On addition chains
• Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
• The Scholz-Brauer problem on addition chains

Cited in

(21)

• Efficient generation of shortest addition-multiplication chains
• Chain addition cycles
• Koblitz curves over quadratic fields
• Addition chains meet postage stamps: reducing the number of multiplications
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• The Scholz conjecture on addition chain is true for infinitely many integers with $\ell(2n)= \ell(n)$
• scientific article; zbMATH DE number 1946632 (Why is no real title available?)
• Lower Bounds for Lucas Chains
• On-line evaluation of powers using Euclid's algorithm
• A Conjecture in Addition Chains Related to Scholz's Conjecture
• Addition chains using continued fractions
• Computing When Multiplications Cost Nothing
• scientific article; zbMATH DE number 1665443 (Why is no real title available?)
• scientific article; zbMATH DE number 7235119 (Why is no real title available?)
• Star reduction among minimal length addition chains
• Minimizing sums of addition chains
• Some results on addition/subtraction chains
• Internal structure of addition chains: well-ordering
• Addition chains, vector chains, and efficient computation
• Improved generation of minimal addition chains
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Calculating optimal addition chains

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