Star reduction among minimal length addition chains
- 5 January 2011
- journal article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 91 (4), 335-352
- https://doi.org/10.1007/s00607-010-0122-z
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Improved Generation of Minimal Addition ChainsComputing, 2006
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is TrueJournal of Algorithms, 2002
- Efficient Generation of Minimal Length Addition ChainsSIAM Journal on Computing, 1999
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- Addition chains — an erratic sequenceDiscrete Mathematics, 1993
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- A lower bound for the length of addition chainsTheoretical Computer Science, 1975
- The Scholz-Brauer problem on addition chainsPacific Journal of Mathematics, 1973