{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T19:10:07Z","timestamp":1751829007381,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T00:00:00Z","timestamp":1535673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10586-018-2840-5","type":"journal-article","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T05:11:32Z","timestamp":1535692292000},"page":"2001-2011","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A fast GPU-based hybrid algorithm for addition chains"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8137-7939","authenticated-orcid":false,"given":"Hatem M.","family":"Bahig","sequence":"first","affiliation":[]},{"given":"Khaled A.","family":"AbdElbari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,31]]},"reference":[{"key":"2840_CR1","doi-asserted-by":"crossref","unstructured":"Campeotto, F., Dovier, A., Fioretto, F., Pontelli. E.: A GPU implementation of large neighborhood search for solving constraint optimization problems. In: Proceedings of the European Conference on Artificial Intelligence (ECAI). pp. 189\u2013194 (2014)","DOI":"10.3233\/978-1-61499-419-0-189"},{"issue":"12","key":"2840_CR2","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.parco.2010.07.002","volume":"36","author":"K Hawick","year":"2010","unstructured":"Hawick, K., Leist, A., Playne, D.: Parallel graph component labelling with gpus and cuda. Parallel Comput. 36(12), 655\u2013678 (2010)","journal-title":"Parallel Comput."},{"key":"2840_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing-HIPC","author":"P Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) High Performance Computing-HIPC. Lecture Notes in Computer Science, pp. 197\u2013208. Springer, New York (2007)"},{"key":"2840_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Schmidt, B., Weiguo, L., Muller-Wittig, W.: GPU-MEME: Using graphics hardware to accelerate motif finding in DNA sequences. Pattern Recognition in Bioinformatics, Third IAPR International Conference, PRIB, Melbourne. Lecture Notes in Computer Science, Springer. pp. 52\u201365 (2008)","DOI":"10.1007\/978-3-540-88436-1_38"},{"issue":"12","key":"2840_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/bioinformatics\/btu264","volume":"30","author":"Y Zhou","year":"2014","unstructured":"Zhou, Y., Xu, W., Donald, B.R., Zeng, J.: An efficient parallel algorithm for accelerating computational protein design. Bioinformatics 30(12), 255\u2013263 (2014)","journal-title":"Bioinformatics"},{"key":"2840_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/FI-2012-626","volume":"114","author":"A Biryukov","year":"2012","unstructured":"Biryukov, A., Gro\u00dfsch\u00e4dl, J.: Cryptanalysis of the full AES using GPU-like special-purpose hardware. Fundam. Inform. 114, 221\u2013237 (2012)","journal-title":"Fundam. Inform."},{"issue":"1","key":"2840_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TIFS.2016.2603974","volume":"12","author":"W Pan","year":"2017","unstructured":"Pan, W., Zheng, F., Zhao, Y., Zhu, W.T., Jing, J.: An efficient elliptic curve cryptography signature server with GPU acceleration. IEEE Trans. Inform. Forensics Secur. 12(1), 111\u2013122 (2017)","journal-title":"IEEE Trans. Inform. Forensics Secur."},{"key":"2840_CR8","doi-asserted-by":"publisher","first-page":"2088","DOI":"10.1016\/j.jss.2011.05.027","volume":"84","author":"F Milob","year":"2011","unstructured":"Milob, F., Bernaschia, M., Bissonb, M.: A fast, GPU based, dictionary attack to openPGP secret keyrings. J. Syst. Softw. 84, 2088\u20132096 (2011)","journal-title":"J. Syst. Softw."},{"issue":"6","key":"2840_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2840_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2840_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM. 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM."},{"key":"2840_CR12","doi-asserted-by":"crossref","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo $$p^k q.$$ p k q . In: Advances in Cryptology\u2014CRYPTO'98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998. Lecture Notes in Computer Science, vol. 1462, pp. 318\u2013326 (1998)","DOI":"10.1007\/BFb0055738"},{"key":"2840_CR13","series-title":"Lecture Notes in Computer Science","first-page":"200","volume-title":"Advances in Cryptology-EUROCRYPT \u201992, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfured, Hungary, May 24-28, 1992","author":"EF Brickell","year":"1992","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201992, Workshop on the Theory and Application of Cryptographic Techniques, Balatonfured, Hungary, May 24-28, 1992. Lecture Notes in Computer Science, vol. 658, pp. 200\u2013207. Springer, New York (1992)"},{"key":"2840_CR14","series-title":"Lecture Notes in Computer Science","first-page":"400","volume-title":"Advances in Cryptology-CRYPTO \u201989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989","author":"J Bos","year":"1989","unstructured":"Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) Advances in Cryptology\u2014CRYPTO\u201989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989. Lecture Notes in Computer Science, vol. 435, pp. 400\u2013407. Springer, New York (1989)"},{"key":"2840_CR15","series-title":"Lecture Notes in Computer Science","first-page":"389","volume-title":"Advances in Cryptology-EUROCRYPT \u201994, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994","author":"P Rooij De","year":"1994","unstructured":"De Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: Helleseth, T. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201994, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994. Lecture Notes in Computer Science, vol. 950, pp. 389\u2013399. Springer, New York (1994)"},{"key":"2840_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"122","author":"DM Gordon","year":"1998","unstructured":"Gordon, D.M.: A survey of fast exponentiation methods. J. Algorithms 122, 129\u2013146 (1998)","journal-title":"J. Algorithms"},{"key":"2840_CR17","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s13369-017-2797-3","volume":"43","author":"K Fathy","year":"2018","unstructured":"Fathy, K., Bahig, H., Ragab, A.: A fast parallel modular exponentiation algorithm. Arab. J. Sci. Eng. 43, 903\u2013911 (2018)","journal-title":"Arab. J. Sci. Eng."},{"issue":"1","key":"2840_CR18","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s11227-017-2129-0","volume":"74","author":"H Bahig","year":"2018","unstructured":"Bahig, H.: A fast optimal parallel algorithm for a short addition chain. J. Supercomput. 74(1), 324\u2013333 (2018)","journal-title":"J. Supercomput."},{"issue":"3","key":"2840_CR19","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P Downey","year":"1981","unstructured":"Downey, P., Leong, B., Sethi, R.: Computing sequences with addition chains. SIAM J. Comput. 10(3), 638\u2013646 (1981)","journal-title":"SIAM J. Comput."},{"key":"2840_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00607-010-0119-7","volume":"91","author":"H Bahig","year":"2011","unstructured":"Bahig, H., Bahig, H.: A new strategy for generating shortest addition sequences. Computing 91, 285\u2013306 (2011)","journal-title":"Computing"},{"key":"2840_CR21","first-page":"461","volume-title":"Art of Computer Programming, Volume 2: Seminumerical Algorithm","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: Art of Computer Programming, Volume 2: Seminumerical Algorithm, pp. 461\u2013485. Addison-Wesley, Reading (1997)"},{"key":"2840_CR22","unstructured":"Bleichenbacher, D., Flammenkamp, A.: An efficient algorithm for computing shortest addition chains. http:\/\/www.homes.uni-bielefeld.de\/achim\/additionchain.html (unpublished)"},{"key":"2840_CR23","unstructured":"Chin, Y.H., Tsai, Y.H.: Algorithms for finding the shortest addition chain. In: Proceedings of national computer symposium, Kaoshiung, Taiwan. December 20\u201322, pp. 1398\u20131414 (1985)"},{"key":"2840_CR24","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1137\/S0097539795295663","volume":"28","author":"EG Thurber","year":"1999","unstructured":"Thurber, E.G.: Efficient generation of minimal length addition chains. SIAM J. Comput. 28, 1247\u20131263 (1999)","journal-title":"SIAM J. Comput."},{"key":"2840_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00607-006-0170-6","volume":"78","author":"H Bahig","year":"2006","unstructured":"Bahig, H.: Improved generation of minimal addition chains. Computing 78, 161\u2013172 (2006)","journal-title":"Computing"},{"key":"2840_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00607-010-0122-z","volume":"91","author":"H Bahig","year":"2011","unstructured":"Bahig, H.: Star reduction among minimal length addition chains. Computing 91, 335\u2013352 (2011)","journal-title":"Computing"},{"issue":"3","key":"2840_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00607-010-0118-8","volume":"91","author":"NM Clift","year":"2011","unstructured":"Clift, N.M.: Calculating optimal addition chains. Computing 91(3), 265\u2013284 (2011)","journal-title":"Computing"},{"key":"2840_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(75)90008-0","volume":"1","author":"A Schnhage","year":"1975","unstructured":"Schnhage, A.: A lower bound for the length of addition chains. Theor. Comput. Sci. 1, 1\u201312 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"2840_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.2140\/pjm.1973.49.229","volume":"49","author":"EG Thurber","year":"1973","unstructured":"Thurber, E.G.: The Scholz\u2013Brauer problem on addition chains. Pac. J. Math. 49, 229\u2013242 (1973)","journal-title":"Pac. J. Math."},{"key":"2840_CR30","unstructured":"NVIDIA. NVIDIA CUDA C Programming Guide, CUDA Toolkit Documentation"},{"issue":"2","key":"2840_CR31","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.compeleceng.2011.11.023","volume":"38","author":"B Mahafzah","year":"2012","unstructured":"Mahafzah, B., Mohammad, A.: The optical chained-cubic tree interconnection network: topological structure and properties. Comput. Electr. Eng. 38(2), 330\u2013345 (2012)","journal-title":"Comput. Electr. Eng."},{"issue":"5","key":"2840_CR32","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00607-011-0177-5","volume":"94","author":"B Mahafzah","year":"2012","unstructured":"Mahafzah, B., Sleit, A.: The OTIS hyper hexa-cell optoelectronic architecture. Computing 94(5), 411\u2013432 (2012)","journal-title":"Computing"},{"issue":"3","key":"2840_CR33","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1177\/0165551513519212","volume":"40","author":"B Mahafzah","year":"2014","unstructured":"Mahafzah, B.: Performance evaluation of parallel multithreaded A* heuristic search algorithm. J. Inform. Sci 40(3), 363\u2013375 (2014)","journal-title":"J. Inform. Sci"},{"issue":"1","key":"2840_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1080\/17445761003604521","volume":"26","author":"B Mahafzah","year":"2011","unstructured":"Mahafzah, B.: Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation. Int. J. Parallel Emerg. Distrib Syst. 26(1), 61\u201382 (2011)","journal-title":"Int. J. Parallel Emerg. Distrib Syst."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2840-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2840-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2840-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T18:34:51Z","timestamp":1751826891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2840-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,31]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2840"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2840-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2018,8,31]]},"assertion":[{"value":"9 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}