Calculating optimal addition chains
Open Access
- 11 September 2010
- journal article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 91 (3), 265-284
- https://doi.org/10.1007/s00607-010-0118-8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is TrueJournal of Algorithms, 2002
- Integers with a small number of minimal addition chainsDiscrete Mathematics, 1999
- Efficient Generation of Minimal Length Addition ChainsSIAM Journal on Computing, 1999
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Addition chains and solutions of l(2n) = l(n) and l(2n − 1) = n + l(n) − 1Discrete Mathematics, 1976
- The Scholz-Brauer problem on addition chainsPacific Journal of Mathematics, 1973
- A Lower Bound for the Scholz-Brauer ProblemCanadian Journal of Mathematics, 1969
- A note on the Scholz-Brauer problem in addition chainsProceedings of the American Mathematical Society, 1953
- On addition chainsBulletin of the American Mathematical Society, 1939