Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference20 articles.
1. Bahig HM (2006) Improved generation of minimal addition chains. Computing 78: 161–172
2. Bahig HM, Nakamula K (2002) Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true. J Algorithms 42: 304–316
3. Bleichenbacher D, Flammenkamp A An efficient algorithm for computing shortest addition chains. http://www.homes.uni-bielefeld.de/achim/addition_chain.html (unpublished)
4. Bos J, Coster M (1989) Addition chain heuristics. In: Brassard G (ed) Advances in cryptology—CRYPTO ’89. Lecture notes in computer science, vol 435, pp 400–407
5. Brickell EF, Gordon DM, McCurley KS, Wilson D (1993) Fast exponentiation with precomputation. In: Rueppel RA (ed) Advances in cryptology—EUROCRYPT ’92. Lecture notes in computer science, vol 658, pp 200–207
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献