{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:16:36Z","timestamp":1780956996126,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T00:00:00Z","timestamp":1285286400000},"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,3]]},"DOI":"10.1007\/s00607-010-0119-7","type":"journal-article","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T01:16:35Z","timestamp":1285204595000},"page":"285-306","source":"Crossref","is-referenced-by-count":2,"title":["A new strategy for generating shortest addition sequences"],"prefix":"10.1007","volume":"91","author":[{"given":"Hatem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hazem M.","family":"Bahig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,24]]},"reference":[{"key":"119_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00607-006-0170-6","volume":"78","author":"H Bahig","year":"2006","unstructured":"Bahig H (2006) Improved generation of minimal addition chains. Computing 78: 161\u2013172","journal-title":"Computing"},{"key":"119_CR2","unstructured":"Bahig H, Bahig H (2006) Speeding up evaluation of powers and monomials. In: Proceedings of the 2006 international conference on foundations of computer science, June 26\u201329, pp 149\u2013153 (an extended abstract)"},{"key":"119_CR3","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1006\/jagm.2002.1212","volume":"42","author":"H Bahig","year":"2002","unstructured":"Bahig H, 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":"119_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.5802\/jtnb.104","volume":"6","author":"F Bergeron","year":"1994","unstructured":"Bergeron F, Berstel J, Brlek S (1994) Efficient computation of addition chains. J Theor Nombres Bord 6: 21\u201338","journal-title":"J Theor Nombres Bord"},{"key":"119_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0196-6774(89)90036-9","volume":"10","author":"F Bergeron","year":"1989","unstructured":"Bergeron F, Berstel J, Brlek S, Duboc C (1989) Addition chains using continued fractions. J Algorithms 10: 403\u2013412","journal-title":"J Algorithms"},{"key":"119_CR6","unstructured":"Bleichenbacher D (1996) Efficiency and security of cryptosystems based on number theory, chap 4. A Docotor Thesis, Swiss Federal Institue of Technology Zurich, Zurich"},{"key":"119_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/00207169408804350","volume":"54","author":"Y Chen","year":"1994","unstructured":"Chen Y, Chang C, Yang W (1994) Some properties of vectorial addition chains. Int J Comput Math 54: 185\u2013196","journal-title":"Int J Comput Math"},{"key":"119_CR8","unstructured":"Chin YH, Tsai YH (1985) Algorithms for finding the shortest addition chain. In: Proceedings of national computer symposium, Kaoshiung, Taiwan, December 20\u201322, pp 1398\u20131414"},{"key":"119_CR9","doi-asserted-by":"crossref","unstructured":"de Rooij P (1995) Efficient exponentiation using precomputation and vector addition chains. In: Advances in cryptology\u2014EUROCRYPT \u201994 (Perugia), lecture notes in computer science, vol 950, pp 389\u2013399","DOI":"10.1007\/BFb0053453"},{"issue":"3","key":"119_CR10","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":"119_CR11","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":"119_CR12","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":"119_CR13","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":"119_CR14","unstructured":"Laih C, Yen S (1992) Secure addition sequence and its applications on the server-aided secret computation protocols. In: Advances in cryptology-AUSCRYPT\u201992, lecture notes in computer science, vol 718, pp 219\u2013229"},{"key":"119_CR15","unstructured":"Laih C, Yen S, Harn L (1991) Two efficient server-aided secret computation protocols based on the addition sequence. In: Advances in cryptology-ASIACRYPT\u201991, pp 450\u2013459"},{"key":"119_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0196-6774(81)90003-1","volume":"2","author":"J Olives","year":"1981","unstructured":"Olives J (1981) On vectorial addition chains. J Algorithms 2: 13\u201321","journal-title":"J Algorithms"},{"issue":"2","key":"119_CR17","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(2): 120\u2013126","journal-title":"Commun ACM"},{"key":"119_CR18","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":"119_CR19","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":"119_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"},{"key":"119_CR21","unstructured":"Yen S, Laih C (1992) The fast cascade exponentiation algorithm and its applications on cryptography. In: Proceeding of Auscrypt\u201992, Australia, lecture notes in computer science, vol 718, pp 447\u2013456"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0119-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-010-0119-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0119-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T21:02:48Z","timestamp":1559682168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0119-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,24]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["119"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0119-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,24]]}}}