{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T21:38:50Z","timestamp":1779226730471,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319165004","type":"print"},{"value":"9783319165011","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16501-1_16","type":"book-chapter","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T08:19:22Z","timestamp":1426321162000},"page":"192-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Evolutionary Methods for the Construction of Cryptographic Boolean Functions"],"prefix":"10.1007","author":[{"given":"Stjepan","family":"Picek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian F.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Marchiori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lejla","family":"Batina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,15]]},"reference":[{"key":"16_CR1","unstructured":"Braeken, A.: Cryptographic Properties of Boolean Functions and S-Boxes. Ph.D. thesis, Katholieke Universiteit Leuven (2006)"},{"key":"16_CR2","unstructured":"Burnett, L.D.: Heuristic optimization of boolean functions and substitution boxes for cryptography. Ph.D. thesis, Queensland University of Technology (2005)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-11145-7_5","volume-title":"Information and Communications Security","author":"C Cid","year":"2009","unstructured":"Cid, C., Kiyomoto, S., Kurihara, J.: The rakaposhi stream cipher. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol. 5927, pp. 32\u201346. Springer, Heidelberg (2009)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36231-2_20","volume-title":"Progress in Cryptology - INDOCRYPT 2002","author":"JA Clark","year":"2002","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S., Maitra, S., Millan, W.L.: Evolving boolean functions satisfying multiple criteria. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 246\u2013259. Springer, Heidelberg (2002)"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511780448","volume-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering","author":"Y Crama","year":"2010","unstructured":"Crama, Y., Hammer, P.L.: Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 1st edn. Cambridge University Press, New York (2010)","edition":"1"},{"key":"16_CR6","unstructured":"Goossens, K.: Automated creation and selection of cryptographic primitives. Master\u2019s thesis, Katholieke Universiteit Leuven (2005)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kalganova, T., Miller, J.F.: Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness. In: Proceedings NASA\/DoD Workshop on Evolvable Hardware, pp. 54\u201363. IEEE Computer Society (1999)","DOI":"10.1109\/EH.1999.785435"},{"key":"16_CR8","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall\/CRC, Boca Raton (2008)"},{"key":"16_CR9","unstructured":"McLaughlin, J., Clark, J.A.: Evolving balanced boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. Cryptology ePrint Archive, Report 2013\/011 (2013). http:\/\/eprint.iacr.org\/"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"WL Millan","year":"1998","unstructured":"Millan, W.L., Clark, A.J., Dawson, E.: Heuristic design of cryptographically strong balanced boolean functions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 489\u2013499. Springer, Heidelberg (1998)"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1111\/j.0824-7935.2004.00246.x","volume":"20","author":"W Millan","year":"2004","unstructured":"Millan, W., Fuller, J., Dawson, E.: New concepts in evolutionary search for boolean functions in cryptology. Computat. Intell. 20(3), 463\u2013474 (2004)","journal-title":"Computat. Intell."},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"J Miller","year":"2006","unstructured":"Miller, J., Smith, S.: Redundancy and computational efficiency in cartesian genetic programming. IEEE Trans. Evol. Comput. 10(2), 167\u2013174 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR13","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Banzhaf, W., Daida, J.M., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M.J., Smith, R.E. (eds.) GECCO, pp. 1135\u20131142. Morgan Kaufmann (1999)"},{"key":"16_CR14","series-title":"Natural Computing Series","volume-title":"Cartesian Genetic Programming","year":"2011","unstructured":"Miller, J.F. (ed.): Cartesian Genetic Programming. Natural Computing Series. Springer, Heidelberg (2011)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121\u2013132. Springer, Heidelberg (2000)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Miller, J.F., Harding, S.L.: Cartesian Genetic Programming. In: Proceedings of the 10th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2008, pp. 2701\u20132726. ACM, New York (2008)","DOI":"10.1145\/1388969.1389075"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 1991","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-Boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378\u2013386. Springer, Heidelberg (1991)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-319-10762-2_80","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Picek","year":"2014","unstructured":"Picek, S., Batina, L., Jakobovic, D.: Evolving DPA-resistant boolean functions. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 812\u2013821. Springer, Heidelberg (2014)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D., Golub, M.: Evolving cryptographically sound boolean functions. In: GECCO (Companion), pp. 191\u2013192 (2013)","DOI":"10.1145\/2464576.2464671"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/978-3-319-10762-2_81","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Picek","year":"2014","unstructured":"Picek, S., Marchiori, E., Batina, L., Jakobovic, D.: Combining evolutionary computation and algebraic constructions to find cryptography-relevant boolean functions. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 822\u2013831. Springer, Heidelberg (2014)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11502760_29","volume-title":"Fast Software Encryption","author":"E Prouff","year":"2005","unstructured":"Prouff, E.: DPA Attacks and S-Boxes. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 424\u2013441. Springer, Heidelberg (2005). http:\/\/www.iacr.org\/cryptodb\/archive\/2005\/FSE\/3172\/3172.pdf"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-44598-6_32","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"P Sarkar","year":"2000","unstructured":"Sarkar, P., Maitra, S.: Nonlinearity Bounds and Constructions of Resilient Boolean Functions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 515\u2013532. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16501-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:04:09Z","timestamp":1747785849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16501-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165004","9783319165011"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16501-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}