{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:37:44Z","timestamp":1770223064759,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hrvatska Zaklada za Znanost (HR)","award":["IP-2014-09-4882"],"award-info":[{"award-number":["IP-2014-09-4882"]}]},{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven (BE)","doi-asserted-by":"crossref","award":["C16\/15\/058"],"award-info":[{"award-number":["C16\/15\/058"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven (BE)","doi-asserted-by":"crossref","award":["CREA\/14\/005"],"award-info":[{"award-number":["CREA\/14\/005"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CONACyT","award":["221551"],"award-info":[{"award-number":["221551"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10732-017-9340-2","type":"journal-article","created":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:19:16Z","timestamp":1497831556000},"page":"457-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding short and implementation-friendly addition chains with evolutionary algorithms"],"prefix":"10.1007","volume":"24","author":[{"given":"Stjepan","family":"Picek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A. Coello","family":"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","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"9340_CR1","unstructured":"Bernstein, D.J.: Curve25519: New diffie\u2013hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, USA, April 24\u201326, 2006. Proceedings, pp. 207\u2013228. Springer Berlin (2006)"},{"key":"9340_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., Schwabe, P.: Kummer strikes back: new DH speed records. In: Iwata, T., Sarkar, P. (eds.) Advances in Cryptology-EUROCRYPT 2015. Lecture Notes in Computer Science, vol. 8873, pp. 317\u2013337. Springer-Verlag, Berlin (2014)","DOI":"10.1007\/978-3-662-45611-8_17"},{"key":"9340_CR3","doi-asserted-by":"crossref","unstructured":"Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) Advances in Cryptology-CRYPTO\u201989 Proceedings. Lecture Notes in Computer Science, vol. 435, pp. 400\u2013407. Springer, New York (1990)","DOI":"10.1007\/0-387-34805-0_37"},{"issue":"3","key":"9340_CR4","doi-asserted-by":"crossref","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":"9340_CR5","doi-asserted-by":"crossref","unstructured":"Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, e., Paar C. (eds.) Cryptographic Hardware and Embedded Systems. Lecture Notes in Computer Science, vol. 1717, pp. 292\u2013302. Springer (1999)","DOI":"10.1007\/3-540-48059-5_25"},{"key":"9340_CR6","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\/"},{"issue":"1","key":"9340_CR7","doi-asserted-by":"crossref","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. Evolut. Comput. 12(1), 1\u201324 (2008)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9340_CR8","doi-asserted-by":"crossref","unstructured":"Cruz-Cort\u00e9s, N., Rodrguez-Henrquez, F., Ju\u00e1rez-Morales, R., Coello\u00a0Coello, C.: Finding optimal addition chains using a genetic algorithm approach. In: Hao, Y., Liu, J.,\u00a0Wang, Y., Cheung, Y.m.,\u00a0Yin, H.,\u00a0Jiao, L.,\u00a0Ma, J., Jiao, Y.C. (eds.) Computational Intelligence and Security. Lecture Notes in Computer Science, vol. 3801, pp. 208\u2013215. Springer Berlin (2005)","DOI":"10.1007\/11596448_30"},{"key":"9340_CR9","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, July 12\u201316, 2011, pp. 59\u201360 (2011)"},{"key":"9340_CR10","unstructured":"Dom\u00ednguez-Isidro, S., Mezura-Montes, E., Osorio-Hern\u00e1ndez, L.G.: Evolutionary programming for the length minimization of addition chains. Eng. Appl. Artif. Intell. 37, 125\u2013134 (2015)"},{"key":"9340_CR11","doi-asserted-by":"crossref","unstructured":"Faz-Hern\u00e1ndez, A., Longa, P., S\u00e1nchez, A.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV\u2013GLS Curves. In:\u00a0Benaloh, J. (ed.) Topics in Cryptology CT-RSA 2014. Lecture Notes in Computer Science, vol. 8366, pp. 1\u201327. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-04852-9_1"},{"key":"9340_CR12","unstructured":"Flammenkamp, A.: Shortest addition chains (2016). http:\/\/wwwhomes.uni-bielefeld.de\/achim\/addition_chain.html"},{"issue":"3","key":"9340_CR13","doi-asserted-by":"crossref","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":"9340_CR14","doi-asserted-by":"crossref","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Faster Point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) Advances in Cryptology CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 190\u2013200. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44647-8_11"},{"key":"9340_CR15","doi-asserted-by":"crossref","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":"9340_CR16","unstructured":"https:\/\/www.random.org\/ : RANDOM.ORG (2016). https:\/\/www.random.org\/"},{"key":"9340_CR17","unstructured":"Jakobovic, D., et\u00a0al.: Evolutionary computation framework (2016). http:\/\/gp.zemris.fer.hr\/ecf\/"},{"key":"9340_CR18","unstructured":"Knuth, D.E.: The Art of Computer Programming : Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley Longman Publishing, Boston (1997)"},{"key":"9340_CR19","unstructured":"Le, D.P.: Fast quadrupling of a point in elliptic curve cryptography. Cryptology ePrint archive, report 2011\/039 (2011). http:\/\/eprint.iacr.org\/2011\/039"},{"key":"9340_CR20","doi-asserted-by":"crossref","unstructured":"Le\u00f3n-Javier, A., Cruz-Cort\u00e9s, N., Moreno-Armend\u00e1riz, M., 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: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol. 5845, pp. 680\u2013691. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05258-3_60"},{"key":"9340_CR21","doi-asserted-by":"crossref","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)"},{"key":"9340_CR22","doi-asserted-by":"crossref","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Minimal addition chain for efficient modular exponentiation using genetic algorithms. In: Hendtlass, T., Ali, M. (eds.) Developments in Applied Artificial Intelligence. Lecture Notes in Computer Science, vol. 2358, pp. 88\u201398. Springer, Berlin (2002a)","DOI":"10.1007\/3-540-48035-8_10"},{"key":"9340_CR23","doi-asserted-by":"crossref","unstructured":"Nedjah, N., de\u00a0Macedo\u00a0Mourelle, L.: Minimal addition\u2013subtraction chains using genetic algorithms. In: Yakhno, T. (ed.) Advances in Information Systems. Lecture Notes in Computer Science, vol. 2457, pp. 303\u2013313. Springer (2002b)","DOI":"10.1007\/3-540-36077-8_31"},{"key":"9340_CR24","doi-asserted-by":"crossref","unstructured":"Nedjah, N., de\u00a0Macedo\u00a0Mourelle, 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.) Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, vol. 2690, pp. 329\u2013336. Springer (2003)","DOI":"10.1007\/978-3-540-45080-1_43"},{"key":"9340_CR25","doi-asserted-by":"crossref","unstructured":"Nedjah, N., de Macedo Mourelle, L.: Finding minimal addition chains using ant colony. In: Yang, Z., Yin, H., Everson, R. (eds.) Intelligent Data Engineering and Automated Learning - IDEAL 2004. Lecture Notes in Computer Science, vol. 3177, pp. 642\u2013647. Springer, Berlin Heidelberg (2004)","DOI":"10.1007\/978-3-540-28651-6_94"},{"issue":"4","key":"9340_CR26","doi-asserted-by":"crossref","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"},{"issue":"7","key":"9340_CR27","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., 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":"9340_CR28","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 IEEE Congress on Evolutionary Computation, Trondheim, Norway, 18\u201321 May, pp. 1422\u20131429 (2009)","DOI":"10.1109\/CEC.2009.4983110"},{"key":"9340_CR29","unstructured":"Picek, S., Coello, C.A.C., Jakobovic, D., Mentens, N.: Evolutionary algorithms for finding short addition chains: going the distance. In: Evolutionary Computation in Combinatorial Optimization-16th European Conference, EvoCOP 2016, Porto, Portugal, March 30\u2013April 1, 2016, Proceedings, pp. 121\u2013137 (2016)"},{"issue":"2","key":"9340_CR30","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.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9340_CR31","doi-asserted-by":"crossref","unstructured":"Rodriguez-Cristerna, A., Torres-Jimenez, J.: A genetic algorithm for the problem of minimal brauer chains. In: Recent Advances on Hybrid Intelligent Systems, Studies in Compter Intelligence, vol. 451, pp. 481\u2013500. Springer Berlin (2013)","DOI":"10.1007\/978-3-642-33021-6_37"},{"issue":"7","key":"9340_CR32","first-page":"267","volume":"3","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) 3(7), 267\u2013273 (2012)","journal-title":"Int. J. Comput. Sci. Eng. Technol. (IJCSET)"},{"key":"9340_CR33","unstructured":"Stein, W.A., et\u00a0al.: Sage mathematics software (Version 5.10). The Sage Development Team (2013). http:\/\/www.sagemath.org"},{"issue":"4","key":"9340_CR34","doi-asserted-by":"crossref","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."},{"issue":"1","key":"9340_CR35","doi-asserted-by":"crossref","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."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9340-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9340-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9340-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T03:32:47Z","timestamp":1569468767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9340-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9340"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9340-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,19]]}}}