{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:06Z","timestamp":1740123546220,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T00:00:00Z","timestamp":1503878400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s11227-017-2129-0","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T17:01:22Z","timestamp":1503939682000},"page":"324-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A fast optimal parallel algorithm for a short addition chain"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9448-6168","authenticated-orcid":false,"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,28]]},"reference":[{"key":"2129_CR1","volume-title":"Parallel computation: models and methods","author":"S Akl","year":"1997","unstructured":"Akl S (1997) Parallel computation: models and methods. Prentice Hall, Upper Saddle River"},{"key":"2129_CR2","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":"2129_CR3","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 de Theorie Nombres de Bordeaux 6:21\u201338","journal-title":"J de Theorie Nombres de Bordeaux"},{"key":"2129_CR4","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":"2129_CR5","doi-asserted-by":"crossref","unstructured":"Bos J, Coster M (1990) Matthijs. Addition chain heuristics. In: Proceedings on advances in cryptology, vol 435. LNCS, pp 400\u2013407","DOI":"10.1007\/0-387-34805-0_37"},{"key":"2129_CR6","unstructured":"Chin YH, Tsai YH (1985) Algorithms for finding the shortest addition chain. In: Proceedings of national computer symposium, Kaoshiung, Taiwan, Dec 20\u201322, pp 1398\u20131414"},{"key":"2129_CR7","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P Downey","year":"1981","unstructured":"Downey P, Leong B, Sethi R (1981) Computing sequences with addition chains. SIAM J Comput 3:638\u2013646","journal-title":"SIAM J Comput"},{"issue":"1","key":"2129_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"DM Gordon","year":"1998","unstructured":"Gordon DM (1998) A survey of fast exponentiation methods. J Algorithms 27(1):129\u2013146","journal-title":"J Algorithms"},{"key":"2129_CR9","doi-asserted-by":"crossref","unstructured":"Karp R, Ramachandran V (1990) Parallel Algorithms for Shared Memory Machines. In: Van Leeuwwen J (ed) Handbook of Theoretical Computer Science. Algorithm and Complexity, vol A. Elsevier, pp 869\u2013941","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"2129_CR10","unstructured":"Khaled F, Hazem B, Hatem B, Ragab A (2011) Binary addition chain on EREW PRAM. In: Lecture notes in computer science, vol 7017, pp 321\u2013330"},{"key":"2129_CR11","volume-title":"The art of computer programming: seminumerical algorithms","author":"D Knuth","year":"1973","unstructured":"Knuth D (1973) The art of computer programming: seminumerical algorithms, vol 2. Addison-Wesley, Boston"},{"key":"2129_CR12","first-page":"72","volume":"E81\u2013A","author":"N Kunihiro","year":"1998","unstructured":"Kunihiro N, Yamamoto H (1998) Window and extended window methods for addition chain and addition-substraction chain, special section on cryptography and information security. IEICE Trans Fundam E81\u2013A:72\u201381","journal-title":"IEICE Trans Fundam"},{"issue":"1","key":"2129_CR13","first-page":"60","volume":"E83\u2013A","author":"N Kunihiro","year":"2000","unstructured":"Kunihiro N, Yamamoto H (2000) New methods for generating short addition chains. IEICE Trans Fundam E83\u2013A(1):60\u201367","journal-title":"IEICE Trans Fundam"},{"issue":"1","key":"2129_CR14","first-page":"34","volume":"2","author":"Y Lee","year":"2006","unstructured":"Lee Y, Kim H, Hong S, Yoon H (2006) Expansion of sliding window method for finding shorter addition\/subtraction-chains. Int J Netw Secur 2(1):34\u201340","journal-title":"Int J Netw Secur"},{"key":"2129_CR15","doi-asserted-by":"crossref","unstructured":"Li Y, Ma Q (2010) Design and implementation of layer extended shortest addition chains database for fast modular exponentiation in RSA. In: 2010 International Conference on Web Information Systems and Mining, China, IEEE proceeding, pp 136\u2013139","DOI":"10.1109\/WISM.2010.174"},{"issue":"9","key":"2129_CR16","doi-asserted-by":"crossref","first-page":"2421","DOI":"10.1109\/TC.2014.2375182","volume":"64","author":"K Jrvinen","year":"2015","unstructured":"Jrvinen K, Dimitrov V, AzarderakhshA R (2015) Generalization of addition chains and fast inversions in binary fields. IEEE Trans Comput 64(9):2421\u20132432","journal-title":"IEEE Trans Comput"},{"key":"2129_CR17","doi-asserted-by":"crossref","unstructured":"Nedjah N, Mourelle LM (2002) Minimal addition chains using genetic algorithms. In: Proceedings of the Fifteenth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Lecture notes in computer science, vol 2358, pp 88\u201398","DOI":"10.1007\/3-540-36077-8_31"},{"issue":"4","key":"2129_CR18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10852-005-9024-z","volume":"5","author":"N Nedjah","year":"2006","unstructured":"Nedjah N, Mourelle LM (2006) Towards minimal addition chains using ant colony optimization. J Math Model Algorithms 5(4):525\u2013543","journal-title":"J Math Model Algorithms"},{"key":"2129_CR19","doi-asserted-by":"crossref","first-page":"4302","DOI":"10.1016\/j.asoc.2010.08.023","volume":"11","author":"N Nedjah","year":"2011","unstructured":"Nedjah N, Mourelle LM (2011) High-performance SoC-based implementation of modular exponentiation using evolutionary addition chains for efficient cryptography. Appl Soft Comput 11:4302\u20134311","journal-title":"Appl Soft Comput"},{"key":"2129_CR20","doi-asserted-by":"crossref","unstructured":"Rooij P (1995) Efficient Exponentiation using precomputation and vector addition chains. In: Advances in cryptology\u2013EUROCRYPT \u201994 (Perugia). Lecture notes in computer science, vol 950, pp 389\u2013399","DOI":"10.1007\/BFb0053453"},{"key":"2129_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Schonhage","year":"1971","unstructured":"Schonhage A, Strassen V (1971) Schnelle multiplikation GroBer Zahlen. Computing 7:281\u2013292","journal-title":"Computing"},{"key":"2129_CR22","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":"2129_CR23","volume-title":"Digital design: principles and practices package","author":"John F Wakerly","year":"2006","unstructured":"Wakerly John F (2006) Digital design: principles and practices package. Prentice Hall, Upper Saddle River"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2129-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2129-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2129-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T17:22:53Z","timestamp":1514827373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2129-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,28]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["2129"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2129-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2017,8,28]]}}}