Calculating optimal addition chains
From MaRDI portal
Publication:644848
DOI10.1007/S00607-010-0118-8zbMATH Open1241.11139DBLPjournals/computing/Clift11OpenAlexW2147037654WikidataQ55953253 ScholiaQ55953253MaRDI QIDQ644848FDOQ644848
Authors: Neill Michael Clift 
Publication date: 7 November 2011
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0118-8
Recommendations
Directed graphs (digraphs), tournaments (05C20) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)
Cites Work
- Title not available (Why is that?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On addition chains
- A Survey of Fast Exponentiation Methods
- Efficient Generation of Minimal Length Addition Chains
- A Lower Bound for the Scholz-Brauer Problem
- Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\)
- Integers with a small number of minimal addition chains
- The Scholz-Brauer problem on addition chains
- Title not available (Why is that?)
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
- A Note on the Scholz-Brauer Problem in Addition Chains
Cited In (21)
- Efficient generation of shortest addition-multiplication chains
- Koblitz curves over quadratic fields
- Chain addition cycles
- Addition chains meet postage stamps: reducing the number of multiplications
- The Scholz conjecture on addition chain is true for infinitely many integers with $\ell(2n)= \ell(n)$
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- Improved generation of minimal addition chains
Uses Software
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)
