{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:16:37Z","timestamp":1780956997001,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00607-010-0122-z","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:45:17Z","timestamp":1294141517000},"page":"335-352","source":"Crossref","is-referenced-by-count":4,"title":["Star reduction among minimal length addition chains"],"prefix":"10.1007","volume":"91","author":[{"given":"Hatem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"122_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00607-006-0170-6","volume":"78","author":"HM Bahig","year":"2006","unstructured":"Bahig HM (2006) Improved generation of minimal addition chains. Computing 78: 161\u2013172","journal-title":"Computing"},{"key":"122_CR2","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: 304\u2013316","journal-title":"J Algorithms"},{"key":"122_CR3","unstructured":"Bleichenbacher D, Flammenkamp A An efficient algorithm for computing shortest addition chains. http:\/\/www.homes.uni-bielefeld.de\/achim\/addition_chain.html (unpublished)"},{"key":"122_CR4","doi-asserted-by":"crossref","unstructured":"Bos J, Coster M (1989) Addition chain heuristics. In: Brassard G (ed) Advances in cryptology\u2014CRYPTO \u201989. Lecture notes in computer science, vol 435, pp 400\u2013407","DOI":"10.1007\/0-387-34805-0_37"},{"key":"122_CR5","doi-asserted-by":"crossref","unstructured":"Brickell EF, Gordon DM, McCurley KS, Wilson D (1993) Fast exponentiation with precomputation. In: Rueppel RA (ed) Advances in cryptology\u2014EUROCRYPT \u201992. Lecture notes in computer science, vol 658, pp 200\u2013207","DOI":"10.1007\/3-540-47555-9_18"},{"key":"122_CR6","unstructured":"Chin YH, Tsai YH (1985) Algorithms for finding the shortest addition chain. In: Proceedings of national computer symposium, Kaoshiung, Taiwan, December 20\u201322, 1985, pp 1398\u20131414"},{"key":"122_CR7","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22: 644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"122_CR8","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P Downey","year":"1981","unstructured":"Downey P, Leong B, Sethi R (1981) Computing sequences with addition chains. SIAM J Comput 10(3): 638\u2013646","journal-title":"SIAM J Comput"},{"key":"122_CR9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T (1985) A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31: 469\u2013472","journal-title":"IEEE Trans Inf Theory"},{"key":"122_CR10","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":"122_CR11","first-page":"461","volume-title":"The art of computer programming: seminumerical algorithms, vol 2","author":"DE Knuth","year":"1997","unstructured":"Knuth DE (1997) The art of computer programming: seminumerical algorithms, vol 2, 3rd edn. Addison-Wesley, Reading, pp 461\u2013485","edition":"3"},{"key":"122_CR12","doi-asserted-by":"crossref","unstructured":"Lim CH, Lee PJ (1994) More flexible exponentiation with precomputation. In: Desmedt YG (ed) Advances in cryptology\u2014CRYPTO \u201994. Lecture notes in computer science, vol 839, pp 95\u2013107","DOI":"10.1007\/3-540-48658-5_11"},{"key":"122_CR13","unstructured":"National Institute of Standards and Technology (2000) Digital signature standard (DSS). Federal Information Processing Standards Publication, FIPS PUB 186-2, Jan 27, 2000"},{"key":"122_CR14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21: 120\u2013126","journal-title":"Commun ACM"},{"key":"122_CR15","doi-asserted-by":"crossref","unstructured":"de Rooij P (1995) Efficient exponentiation using precomputation and vector addition chains. In: Helleseth T (ed) Advances in cryptology\u2014EUROCRYPT \u201994. Lecture notes in computer science, vol 950, pp 389\u2013399","DOI":"10.1007\/BFb0053453"},{"key":"122_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(75)90008-0","volume":"1","author":"A Sch\u00f6nhage","year":"1975","unstructured":"Sch\u00f6nhage A (1975) A lower bound for the length of addition chains. Theor Comput Sci 1: 1\u201312","journal-title":"Theor Comput Sci"},{"key":"122_CR17","first-page":"555","volume-title":"Number theory and applications","author":"M Subbarao","year":"1989","unstructured":"Subbarao M (1989) Addition chains\u2014some results and problems. In: Mollin RA (ed) Number theory and applications. Kluwer, Dordrecht, pp 555\u2013574"},{"key":"122_CR18","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-Brauer problem on addition chains. Pac J Math 49: 229\u2013242","journal-title":"Pac J Math"},{"key":"122_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0012-365X(93)90303-B","volume":"122","author":"EG Thurber","year":"1993","unstructured":"Thurber EG (1993) Addition chains\u2014an erratic sequence. Discrete Math 122: 287\u2013305","journal-title":"Discrete Math"},{"key":"122_CR20","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"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0122-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-010-0122-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0122-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:58:05Z","timestamp":1559919485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0122-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0122-z","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}