{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T02:03:43Z","timestamp":1785895423785,"version":"3.56.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00607-010-0118-8","type":"journal-article","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T06:01:12Z","timestamp":1284098472000},"page":"265-284","source":"Crossref","is-referenced-by-count":23,"title":["Calculating optimal addition chains"],"prefix":"10.1007","volume":"91","author":[{"given":"Neill Michael","family":"Clift","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,11]]},"reference":[{"key":"118_CR1","first-page":"20","volume":"1","author":"H Dellac","year":"1894","unstructured":"Dellac H (1894) Question 49. L\u2019Interm\u00e9diaire Math 1: 20","journal-title":"L\u2019Interm\u00e9diaire Math"},{"issue":"20","key":"118_CR2","first-page":"162","volume":"1","author":"E Jonqui\u00e9res de","year":"1894","unstructured":"de Jonqui\u00e9res E (1894) Question 49 (H. Dellac). L\u2019Interm\u00e9diaire Math 1(20): 162\u2013164","journal-title":"L\u2019Interm\u00e9diaire Math"},{"issue":"2","key":"118_CR3","first-page":"41","volume":"47","author":"A Scholz","year":"1937","unstructured":"Scholz A (1937) Aufgabe 253. Jahresbericht der deutschen Mathematiker-Vereingung 47(2): 41\u201342","journal-title":"Jahresbericht der deutschen Mathematiker-Vereingung"},{"key":"118_CR4","unstructured":"Knuth DE (1997) The art of computer programming V. 2 Seminumerical algorithms, 3rd edn. Addison-Wesly, Reading, pp 461\u2013485 (ISBN 0-201-89684-2)"},{"key":"118_CR5","unstructured":"Gioia AA, Subbarao MV, Sugunamma M (1978) The Scholz\u2013Brauer Problem in Addition Chains II. In: Proc. Eighth Manitoba Conference on Numerical Math. and Computing, XXII, pp 174\u2013251"},{"issue":"4","key":"118_CR6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T (1985) A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inform Theory IT-31(4): 469\u2013472","journal-title":"IEEE Trans Inform Theory"},{"key":"118_CR7","unstructured":"FIPS Publication 186, February 1, 1993, Digital Signature Standard"},{"key":"118_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"122","author":"DM Gordon","year":"1998","unstructured":"Gordon DM (1998) A survey of fast exponentiation methods. J Algorithms 122: 129\u2013146","journal-title":"J Algorithms"},{"key":"118_CR9","doi-asserted-by":"crossref","unstructured":"Osorio-Hern\u00e1ndez L, Mezura-Montes E, Cruz-Cort\u00e9s N, Rodr\u00edguez-Henr\u00edquez F (2009) A genetic algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents. In: IEEE congress on evolutionary computation (CEC) 2009, Trondheim, Norway May 18\u201321, 2009, IEEE Computer Society, 8 p","DOI":"10.1109\/CEC.2009.4983110"},{"key":"118_CR10","unstructured":"Hansen W (1957) Untersuchungen \u00fcber die Scholz\u2013Brauerschen Additionsketten und deren Verallgemeinerung. G\u00f6ttingen, Wiss. Pr\u00fcfungsamt, Schriftl. Hausarbeit zum Staatsexamen"},{"key":"118_CR11","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1137\/S0097539795295663","volume":"28","author":"EG Thurber","year":"1999","unstructured":"Thurber EG (1999) Efficient generation of minimal length addition chains. SIAM J Comput 28: 1247\u20131263","journal-title":"SIAM J Comput"},{"key":"118_CR12","doi-asserted-by":"crossref","unstructured":"Pippenger N (1976) On the evaluation of powers and related problems. In: Proceedings, 19th Annual IEEE Symposium on the foundations of computer science, Houston TX, pp 258\u2013263","DOI":"10.1109\/SFCS.1976.21"},{"issue":"6","key":"118_CR13","first-page":"1171","volume":"111","author":"OB Lupanov","year":"1956","unstructured":"Lupanov OB (1956) Diode and contact-diode circuits. Dokl AN SSSR 111(6): 1171\u20131174","journal-title":"Dokl AN SSSR"},{"key":"118_CR14","unstructured":"Bleichenbacher D, Flammenkamp A (1997) An efficient algorithm for computing shortest addition chains. http:\/\/www.uni-bielefeld.de\/~achim\/ac.dvi"},{"key":"118_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(99)00103-X","volume":"205","author":"A Flammenkamp","year":"1999","unstructured":"Flammenkamp A (1999) Integers with a small number of minimal addition chains. Discrete Math 205: 221\u2013227","journal-title":"Discrete Math"},{"key":"118_CR16","unstructured":"Bleichenbacher D (1996) Efficiency and Security of cryptosystems based on number theory. Dissertation to Swiss Federal Institute of Technology Z\u00fcrich, ETH Z\u00fcrich"},{"key":"118_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.4153\/CJM-1969-077-x","volume":"21","author":"KB Stolarsky","year":"1969","unstructured":"Stolarsky KB (1969) A lower bound for the Scholz\u2013Brauer problem. Can J Math 21: 675\u2013683","journal-title":"Can J Math"},{"key":"118_CR18","first-page":"234","volume":"1","author":"A Goulard","year":"1894","unstructured":"Goulard A (1894) Question 393. L\u2019Interm\u00e9diaire Math 1: 234","journal-title":"L\u2019Interm\u00e9diaire Math"},{"key":"118_CR19","first-page":"125","volume":"2","author":"E Jonqui\u00e9res de","year":"1895","unstructured":"de Jonqui\u00e9res E (1895) Question 393 (A. Goulard). L\u2019Interm\u00e9diaire Math 2: 125\u2013126","journal-title":"L\u2019Interm\u00e9diaire Math"},{"key":"118_CR20","doi-asserted-by":"crossref","unstructured":"Utz WR (1953) A note on the Scholz\u2013Brauer problem in addition chains. In: Proceedings of the American Mathematical Society, vol 4, pp 462\u2013463","DOI":"10.1090\/S0002-9939-1953-0054618-X"},{"key":"118_CR21","first-page":"230","volume":"11","author":"DE Knuth","year":"1964","unstructured":"Knuth DE (1964) Addition chains and the evaluation of n-th powers. Notices Am Math Soc 11: 230\u2013231","journal-title":"Notices Am Math Soc"},{"key":"118_CR22","unstructured":"Thurber EG (1971) The Scholz\u2013Brauer Problem for addition chains. Ph.D. Thesis, University of Southern California"},{"key":"118_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.2140\/pjm.1973.49.229","volume":"49","author":"EG Thurber","year":"1973","unstructured":"Thurber EG (1973) The Scholz\u2013Brauer problem on addition-chains. Pacific J Math 49: 229\u2013242","journal-title":"Pacific J Math"},{"key":"118_CR24","volume-title":"Unsolved problems in number theory","author":"RK Guy","year":"1994","unstructured":"Guy RK (1994) Unsolved problems in number theory, 2nd edn. Springer, New York","edition":"2"},{"key":"118_CR25","unstructured":"The On-Line Encyclopedia of Integer Sequences, http:\/\/www.research.att.com\/~njas\/sequences"},{"key":"118_CR26","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"AT Brauer","year":"1939","unstructured":"Brauer AT (1939) On addition chains. Bull Am Math Soc 45: 736\u2013739","journal-title":"Bull Am Math Soc"},{"key":"118_CR27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0012-365X(76)90105-9","volume":"16","author":"EG Thurber","year":"1976","unstructured":"Thurber EG (1976) Addition chains and solutions of l(2n)\u00a0=\u00a0l(n) and l(2 n-1)\u00a0=\u00a0n\u00a0+\u00a0l(n)\u22121. Discrete Math 16: 279\u2013289","journal-title":"Discrete Math"},{"key":"118_CR28","unstructured":"Thurber EG Private communication"},{"issue":"2","key":"118_CR29","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1006\/jagm.2002.1212","volume":"42","author":"HM Bahig","year":"2002","unstructured":"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(2): 304\u2013316","journal-title":"J Algorithms"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00607-010-0118-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T07:05:40Z","timestamp":1559631940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0118-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,11]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0118-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,11]]}}}