{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:24:51Z","timestamp":1770218691345,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319306971","type":"print"},{"value":"9783319306988","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30698-8_9","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T17:32:10Z","timestamp":1458322330000},"page":"121-137","source":"Crossref","is-referenced-by-count":8,"title":["Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance"],"prefix":"10.1007","author":[{"given":"Stjepan","family":"Picek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A.","family":"Coello Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nele","family":"Mentens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","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":"9_CR2","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley Longman Publishing, Boston (1997)","edition":"3"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"issue":"1","key":"9_CR4","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-brauer problem on addition chains. Pac. J. Math. 49(1), 229\u2013242 (1973)","journal-title":"Pac. J. Math."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1215\/S0012-7094-73-04085-4","volume":"40","author":"EG Thurber","year":"1973","unstructured":"Thurber, E.G.: On addition chains $$1(mn)\\le 1(n)-b$$ 1 ( m n ) \u2264 1 ( n ) - b and lower bounds for $$c(r)$$ c ( r ) . Duke Math. J. 40(4), 907\u2013913 (1973)","journal-title":"Duke Math. J."},{"key":"9_CR6","unstructured":"Flammenkamp, A.: Shortest addition chains (November 2015). http:\/\/wwwhomes.uni-bielefeld.de\/achim\/addition_chain.html"},{"key":"9_CR7","unstructured":"Bernstein, D.J.: Differential addition chains (2006). https:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"DM Gordon","year":"1998","unstructured":"Gordon, D.M.: A survey of fast exponentiation methods. J. Algorithms 27, 129\u2013146 (1998)","journal-title":"J. Algorithms"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"S Galbraith","year":"2011","unstructured":"Galbraith, S., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptol. 24(3), 446\u2013469 (2011)","journal-title":"J. Cryptol."},{"key":"9_CR11","unstructured":"Costello, C., Longa, P.: FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime. Cryptology ePrint Archive, Report 2015\/565 (2015). http:\/\/eprint.iacr.org\/"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-04852-9_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"A Faz-Hern\u00e1ndez","year":"2014","unstructured":"Faz-Hern\u00e1ndez, A., Longa, P., S\u00e1nchez, A.H.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 1\u201327. Springer, Heidelberg (2014)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 1999","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","first-page":"400","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"JNE Bos","year":"1990","unstructured":"Bos, J.N.E., Coster, M.J.: Addition chain heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400\u2013407. Springer, Heidelberg (1990)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-48035-8_10","volume-title":"Developments in Applied Artificial Intelligence \u2013 IEA\/AIE 2002","author":"N Nedjah","year":"2002","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Minimal addition chain for efficient modular exponentiation using genetic algorithms. In: Hendtlass, T., Ali, M. (eds.) IEA\/AIE 2002. LNCS (LNAI), vol. 2358, p. 88. Springer, Heidelberg (2002)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-36077-8_31","volume-title":"Advances in Information Systems \u2013 ADVIS 2002","author":"N Nedjah","year":"2002","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Minimal addition-subtraction chains using genetic algorithms. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol. 2457, pp. 303\u2013313. Springer, Heidelberg (2002)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-45080-1_43","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2003","author":"N Nedjah","year":"2003","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Minimal addition-subtraction sequences for efficient pre-processing in large window-based modular exponentiation using genetic algorithms. In: Liu, J., Cheung, Y.M., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 329\u2013336. Springer, Heidelberg (2003)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-28651-6_94","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2004","author":"N Nedjah","year":"2004","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Finding minimal addition chains using ant colony. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 642\u2013647. Springer, Heidelberg (2004)"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10852-005-9024-z","volume":"5","author":"N Nedjah","year":"2006","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Towards minimal addition chains using ant colony optimisation. J. Math. Model. Algorithms 5(4), 525\u2013543 (2006)","journal-title":"J. Math. Model. Algorithms"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11596448_30","volume-title":"Computational Intelligence and Security","author":"N Cruz-Cort\u00e9s","year":"2005","unstructured":"Cruz-Cort\u00e9s, N., Rodr\u00edguez-Henr\u00edquez, F., Ju\u00e1rez-Morales, R., Coello Coello, C.A.: Finding optimal addition chains using a genetic algorithm approach. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol. 3801, pp. 208\u2013215. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2007.906082","volume":"12","author":"N Cruz-Corte\u00e9s","year":"2008","unstructured":"Cruz-Corte\u00e9s, N., Rodriguez-Henriquez, F., Coello Coello, C.: An artificial immune system heuristic for generating short addition chains. IEEE Trans. Evol. Comput. 12(1), 1\u201324 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Osorio-Hern\u00e1ndez, L.G., Mezura-Montes, E., Cort\u00e9s, N.C., Rodr\u00edguez-Henr\u00edquez, F.: A genetic algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents. In: Proceedings of IEEE Congress on Evolutionary Computation, Trondheim, Norway, pp. 1422\u20131429, 18\u201321 May 2009","DOI":"10.1109\/CEC.2009.4983110"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-642-05258-3_60","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"A Le\u00f3n-Javier","year":"2009","unstructured":"Le\u00f3n-Javier, A., Cruz-Cort\u00e9s, N., Moreno-Armend\u00e1riz, M.A., Orantes-Jim\u00e9nez, S.: Finding minimal addition chains with a particle swarm optimization algorithm. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 680\u2013691. Springer, Heidelberg (2009)"},{"issue":"7","key":"9_CR24","doi-asserted-by":"publisher","first-page":"4302","DOI":"10.1016\/j.asoc.2010.08.023","volume":"11","author":"N Nedjah","year":"2011","unstructured":"Nedjah, N., de Macedo Mourelle, L.: High-performance SoC-based implementation of modular exponentiation using evolutionary addition chains for efficient cryptography. Appl. Soft Comput. 11(7), 4302\u20134311 (2011)","journal-title":"Appl. Soft Comput."},{"key":"9_CR25","first-page":"267","volume":"7","author":"A Sarkar","year":"2012","unstructured":"Sarkar, A., Mandal, J.: Swarm intelligence based faster public-key cryptography in wireless communication (SIFPKC). Int. J. Comput. Sci. Eng. Technol. (IJCSET) 7, 267\u2013273 (2012)","journal-title":"Int. J. Comput. Sci. Eng. Technol. (IJCSET)"},{"key":"9_CR26","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-33021-6_37","volume-title":"Recent Advances on Hybrid Intelligent Systems","author":"A Rodriguez-Cristerna","year":"2013","unstructured":"Rodriguez-Cristerna, A., Torres-Jimenez, J.: A genetic algorithm for the problem of minimal brauer chains. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) RAHIS 2013. SCI, vol. 451, pp. 481\u2013500. Springer, Heidelberg (2013)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Dom\u00ednguez-Isidro, S., Mezura-Montes, E., Osorio-Hern\u00e1ndez, L.G.: Addition chain length minimization with evolutionary programming. In: 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011, Companion Material Proceedings, Dublin, Ireland, pp. 59\u201360, 12\u201316 July 2011","DOI":"10.1145\/2001858.2001893"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.engappai.2014.09.003","volume":"37","author":"S Dom\u00ednguez-Isidro","year":"2015","unstructured":"Dom\u00ednguez-Isidro, S., Mezura-Montes, E., Osorio-Hern\u00e1ndez, L.G.: Evolutionary programming for the length minimization of addition chains. Eng. Appl. AI 37, 125\u2013134 (2015)","journal-title":"Eng. Appl. AI"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-662-45611-8_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"DJ Bernstein","year":"2014","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., Schwabe, P.: Kummer strikes back: new DH speed records. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 317\u2013337. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30698-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T15:06:54Z","timestamp":1655305614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30698-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319306971","9783319306988"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30698-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}