{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:30:26Z","timestamp":1750825826950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030987947"},{"type":"electronic","value":"9783030987954"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98795-4_1","type":"book-chapter","created":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T18:03:58Z","timestamp":1649354638000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Artificial Intelligence for the Design of Symmetric Cryptographic Primitives"],"prefix":"10.1007","author":[{"given":"Luca","family":"Mariot","sequence":"first","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Hernandez-Castro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"1_CR1","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography by cellular automata or how fast can complexity emerge in nature? In: Proceedings of ICS 2010, pp. 1\u201319 (2010)"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford (1996)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bassham III, L.E., et al.: Sp 800\u201322 rev. 1a. a statistical test suite for random and pseudorandom number generators for cryptographic applications. National Institute of Standards & Technology (2010)","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"1_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference, January 2011. http:\/\/keccak.noekeon.org\/"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44706-7_21","volume-title":"Fast Software Encryption","author":"L Burnett","year":"2001","unstructured":"Burnett, L., Carter, G., Dawson, E., Millan, W.: Efficient methods for generating MARS-like S-boxes. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 300\u2013313. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_21"},{"key":"1_CR6","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2021","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1007\/978-3-540-45224-9_161","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"JCH Castro","year":"2003","unstructured":"Castro, J.C.H., Vi\u00f1uela, P.I., del Arco-Calder\u00f3n, C.L.: Finding efficient nonlinear functions by means of genetic programming. In: Palade, V., Howlett, R.J., Jain, L. (eds.) KES 2003. LNCS (LNAI), vol. 2773, pp. 1192\u20131198. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45224-9_161"},{"key":"1_CR8","unstructured":"Castro, J.C.H., Seznec, A., Isasi, P.: On the design of state-of-the-art pseudorandom number generators by means of genetic programming. In: IEEE Congress on Evolutionary Computation, pp. 1510\u20131516. IEEE (2004)"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF03037657","volume":"23","author":"JCH Castro","year":"2005","unstructured":"Castro, J.C.H., Vi\u00f1uela, P.I.: New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA. New Gener. Comput. 23(3), 233\u2013243 (2005)","journal-title":"New Gener. Comput."},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Chopard, B., Tomassini, M.: An Introduction to Metaheuristics for Optimization. Natural Computing Series. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-93073-2","DOI":"10.1007\/978-3-319-93073-2"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/10718964_20","volume-title":"Information Security and Privacy","author":"JA Clark","year":"2000","unstructured":"Clark, J.A., Jacob, J.L.: Two-stage optimisation in the design of boolean functions. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 242\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10718964_20"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1111\/j.0824-7935.2004.00245.x","volume":"20","author":"JA Clark","year":"2004","unstructured":"Clark, J.A., Jacob, J.L., Maitra, S., Stanica, P.: Almost boolean functions: the design of boolean functions by spectral inversion. Comput. Intell. 20(3), 450\u2013462 (2004)","journal-title":"Comput. Intell."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF03037656","volume":"23","author":"JA Clark","year":"2005","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: The design of s-boxes by simulated annealing. New Gener. Comput. 23(3), 219\u2013231 (2005)","journal-title":"New Gener. Comput."},{"key":"1_CR14","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 \u2014 INDOCRYPT 2002","author":"JA Clark","year":"2002","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S., Maitra, S., Millan, W.: Evolving boolean functions satisfying multiple criteria. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 246\u2013259. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_20"},{"issue":"2","key":"1_CR15","first-page":"259","volume":"62","author":"J Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Invertible shift-invariant transformations on binary arrays. Appl. Math. Comput. 62(2), 259\u2013277 (1994)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2018.i4.1-38","volume":"2018","author":"J Daemen","year":"2018","unstructured":"Daemen, J., Hoffert, S., Assche, G.V., Keer, R.V.: The design of Xoodoo and Xoofff. IACR Trans. Symmetric Cryptol. 2018(4), 1\u201338 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1_CR17","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series, 2nd edn. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8","edition":"2"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-13350-8_5","volume-title":"Computing with New Resources","author":"E Formenti","year":"2014","unstructured":"Formenti, E., Imai, K., Martin, B., Yun\u00e8s, J.-B.: Advances on random sequence generation by uniform cellular automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 56\u201370. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_5"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Fuller, J., Millan, W., Dawson, E.: Multi-objective optimisation of bijective S-boxes. In: Proceedings of CEC 2004, pp. 1525\u20131532 (2004)","DOI":"10.1109\/CEC.2004.1331077"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.46586\/tosc.v2018.i3.311-334","volume":"2018","author":"A Ghoshal","year":"2018","unstructured":"Ghoshal, A., Sadhukhan, R., Patranabis, S., Datta, N., Picek, S., Mukhopadhyay, D.: Lightweight and side-channel secure 4 $$\\times $$ 4 S-boxes from cellular automata rules. IACR Trans. Symmetric Cryptol. 2018(3), 311\u2013334 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-26951-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Gohr","year":"2019","unstructured":"Gohr, A.: Improving attacks on round-reduced speck32\/64 using deep learning. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 150\u2013179. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_6"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-10762-2_41","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"R Hrbacek","year":"2014","unstructured":"Hrbacek, R., Dvorak, V.: Bent function synthesis by means of cartesian genetic programming. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 414\u2013423. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_41"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Ilachinski, A.: Cellular Automata: A Discrete Universe. World Scientific Publishing Co. Inc. (2001)","DOI":"10.1142\/4702"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s12095-015-0170-5","volume":"8","author":"G Ivanov","year":"2016","unstructured":"Ivanov, G., Nikolov, N., Nikova, S.: Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties. Cryptogr. Commun. 8(2), 247\u2013276 (2016). https:\/\/doi.org\/10.1007\/s12095-015-0170-5","journal-title":"Cryptogr. Commun."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Jakobovic, D., Picek, S., Martins, M.S.R., Wagner, M.: A characterisation of S-box fitness landscapes in cryptography. In: Auger, A., St\u00fctzle, T. (eds.) Proceedings of GECCO 2019, pp. 285\u2013293. ACM (2019)","DOI":"10.1145\/3321707.3321850"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-92910-9_1","volume-title":"Handbook of Natural Computing","author":"J Kari","year":"2012","unstructured":"Kari, J.: Basic concepts of cellular automata. In: Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 3\u201324. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-92910-9_1"},{"key":"1_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"1_CR28","unstructured":"Koza, J.R.: Evolving a computer program to generate random numbers using the genetic programming paradigm. In: ICGA, pp. 37\u201344. Morgan Kaufmann (1991)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-030-16692-2_15","volume-title":"Applications of Evolutionary Computation","author":"W Krawec","year":"2019","unstructured":"Krawec, W., Picek, S., Jakobovic, D.: Evolutionary algorithms for the design of quantum protocols. In: Kaufmann, P., Castillo, P.A. (eds.) EvoApplications 2019. LNCS, vol. 11454, pp. 220\u2013236. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16692-2_15"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/11844297_86","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"C Lamenca-Martinez","year":"2006","unstructured":"Lamenca-Martinez, C., Hernandez-Castro, J.C., Estevez-Tapiador, J.M., Ribagorda, A.: Lamar: a new pseudorandom number generator evolved by means of genetic programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 850\u2013859. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_86"},{"issue":"5\u20136","key":"1_CR31","first-page":"437","volume":"9","author":"A Leporati","year":"2014","unstructured":"Leporati, A., Mariot, L.: Cryptographic properties of bipermutive cellular automata rules. J. Cell. Autom. 9(5\u20136), 437\u2013475 (2014)","journal-title":"J. Cell. Autom."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-99813-8_39","volume-title":"Cellular Automata","author":"L Manzoni","year":"2018","unstructured":"Manzoni, L., Mariot, L.: Cellular automata pseudo-random number generators and their resistance to asynchrony. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99813-8_39"},{"key":"1_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100646","volume":"54","author":"L Manzoni","year":"2020","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-16670-0_17","volume-title":"Genetic Programming","author":"L Mariot","year":"2019","unstructured":"Mariot, L., Jakobovic, D., Leporati, A., Picek, S.: Hyper-bent boolean functions and evolutionary algorithms. In: Sekanina, L., Hu, T., Louren\u00e7o, N., Richter, H., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2019. LNCS, vol. 11451, pp. 262\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16670-0_17"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-11520-7_43","volume-title":"Cellular Automata","author":"L Mariot","year":"2014","unstructured":"Mariot, L., Leporati, A.: Sharing secrets by computing preimages of bipermutive cellular automata. In: W\u0105s, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 417\u2013426. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11520-7_43"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-26841-5_3","volume-title":"Theory and Practice of Natural Computing","author":"L Mariot","year":"2015","unstructured":"Mariot, L., Leporati, A.: A genetic algorithm for evolving plateaued cryptographic boolean functions. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 33\u201345. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26841-5_3"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Mariot, L., Leporati, A.: Heuristic search by particle swarm optimization of boolean functions for cryptographic applications. In: Silva, S., Esparcia-Alc\u00e1zar, A.I. (eds.) Companion Proceedings of GECCO 2015, pp. 1425\u20131426. ACM (2015)","DOI":"10.1145\/2739482.2764674"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-99253-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary search of binary orthogonal arrays. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 121\u2013133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_10"},{"issue":"1","key":"1_CR39","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12095-018-0311-8","volume":"11","author":"L Mariot","year":"2019","unstructured":"Mariot, L., Picek, S., Leporati, A., Jakobovic, D.: Cellular automata based s-boxes. Cryptogr. Commun. 11(1), 41\u201362 (2019)","journal-title":"Cryptogr. Commun."},{"key":"1_CR40","unstructured":"Marsaglia, G.: The marsaglia random number CDROM including the diehard battery of tests of randomness (2008). http:\/\/www.stat.fsu.edu\/pub\/diehard\/"},{"issue":"2","key":"1_CR41","first-page":"145","volume":"3","author":"B Martin","year":"2008","unstructured":"Martin, B.: A Walsh exploration of elementary CA rules. J. Cell. Autom. 3(2), 145\u2013156 (2008)","journal-title":"J. Cell. Autom."},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-46416-6_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"W Meier","year":"1991","unstructured":"Meier, W., Staffelbach, O.: Analysis of pseudo random sequences generated by cellular automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186\u2013199. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_17"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-47942-0_22","volume-title":"Information and Communication Security","author":"W Millan","year":"1999","unstructured":"Millan, W., Burnett, L., Carter, G., Clark, A., Dawson, E.: Evolutionary heuristics for finding cryptographically strong S-boxes. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 263\u2013274. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-47942-0_22"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0028471","volume-title":"Information and Communications Security","author":"W Millan","year":"1997","unstructured":"Millan, W., Clark, A., Dawson, E.: An effective genetic algorithm for finding highly nonlinear boolean functions. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 149\u2013158. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028471"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"W Millan","year":"1998","unstructured":"Millan, W., Clark, A., 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). https:\/\/doi.org\/10.1007\/BFb0054148"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Picek, S., Carlet, C., Jakobovic, D., Miller, J.F., Batina, L.: Correlation immunity of boolean functions: an evolutionary algorithms perspective. In: Proceedings of GECCO 2015, pp. 1095\u20131102 (2015)","DOI":"10.1145\/2739480.2754764"},{"issue":"4","key":"1_CR47","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1162\/EVCO_a_00191","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Cupic, M., Rotim, L.: A new cost function for evolution of S-boxes. Evol. Comput. 24(4), 695\u2013718 (2016)","journal-title":"Evol. Comput."},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-26841-5_6","volume-title":"Theory and Practice of Natural Computing","author":"S Picek","year":"2015","unstructured":"Picek, S., Guilley, S., Carlet, C., Jakobovic, D., Miller, J.F.: Evolutionary approach for finding correlation immune boolean functions of order t with minimal hamming weight. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 71\u201382. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26841-5_6"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D.: Evolving algebraic constructions for designing bent boolean functions. In: Friedrich, T., Neumann, F., Sutton, A.M. (eds.) Proceedings of GECCO 2016, pp. 781\u2013788. ACM (2016)","DOI":"10.1145\/2908812.2908915"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D., Golub, M.: Evolving cryptographically sound boolean functions. In: Blum, C., Alba, E. (eds.) Companion Proceedings of GECCO 2013, pp. 191\u2013192. ACM (2013)","DOI":"10.1145\/2464576.2464671"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.asoc.2015.10.066","volume":"40","author":"S Picek","year":"2016","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Batina, L., Cupic, M.: Cryptographic boolean functions: one output, many design criteria. Appl. Soft Comput. 40, 635\u2013653 (2016)","journal-title":"Appl. Soft Comput."},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"Picek, S., Knezevic, K., Jakobovic, D., Derek, A.: C$${}^{\\text{3}}$$po: cipher construction with cartesian genetic programming. In: L\u00f3pez-Ib\u00e1\u00f1ez, M., Auger, A., St\u00fctzle, T. (eds.) Companion Proceedings of GECCO 2019, pp. 1625\u20131633. ACM (2019)","DOI":"10.1145\/3319619.3326869"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Picek, S., Knezevic, K., Mariot, L., Jakobovic, D., Leporati, A.: Evolving bent quaternary functions. In: 2018 IEEE Congress on Evolutionary Computation, CEC 2018, Rio de Janeiro, Brazil, 8\u201313 July 2018, pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"1_CR54","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, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_81"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Picek, S., Mariot, L., Leporati, A., Jakobovic, D.: Evolving S-boxes based on cellular automata with genetic programming. In: Bosman, P.A.N. (ed.) Companion Proceedings of GECCO 2017, pp. 251\u2013252. ACM (2017)","DOI":"10.1145\/3067695.3076084"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N.: Design of S-boxes defined with cellular automata rules. In: Proceedings of CF 2017, pp. 409\u2013414. ACM (2017)","DOI":"10.1145\/3075564.3079069"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Picek, S., Miller, J.F., Jakobovic, D., Batina, L.: Cartesian genetic programming approach for generating substitution boxes of different sizes. In: Companion Proceedings of GECCO 2015, pp. 1457\u20131458 (2015)","DOI":"10.1145\/2739482.2764698"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-45823-6_57","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"S Picek","year":"2016","unstructured":"Picek, S., Sisejkovic, D., Rozic, V., Yang, B., Jakobovic, D., Mentens, N.: Evolving cryptographic pseudorandom number generators. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 613\u2013622. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_57"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-54669-8_13","volume-title":"Smart Card Research and Advanced Applications","author":"S Picek","year":"2017","unstructured":"Picek, S., et al.: PRNGs for masking applications and their mapping to evolvable hardware. In: Lemke-Rust, K., Tunstall, M. (eds.) CARDIS 2016. LNCS, vol. 10146, pp. 209\u2013227. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54669-8_13"},{"issue":"5","key":"1_CR60","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1109\/TIT.2006.872862","volume":"52","author":"Z Saber","year":"2006","unstructured":"Saber, Z., Uddin, M.F., Youssef, A.M.: On the existence of (9, 3, 5, 240) resilient functions. IEEE Trans. Inf. Theory 52(5), 2269\u20132270 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5\u20136","key":"1_CR61","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.parco.2003.12.014","volume":"30","author":"F Seredynski","year":"2004","unstructured":"Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Comput. 30(5\u20136), 753\u2013766 (2004)","journal-title":"Parallel Comput."},{"issue":"4","key":"1_CR62","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"issue":"02","key":"1_CR63","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S012918319600017X","volume":"7","author":"M Sipper","year":"1996","unstructured":"Sipper, M., Tomassini, M.: Generating parallel random number generators by cellular programming. Int. J. Mod. Phys. C 7(02), 181\u2013190 (1996)","journal-title":"Int. J. Mod. Phys. C"},{"key":"1_CR64","doi-asserted-by":"publisher","DOI":"10.1201\/9781315282497","volume-title":"Cryptography: Theory and Practice","author":"DR Stinson","year":"2018","unstructured":"Stinson, D.R., Paterson, M.: Cryptography: Theory and Practice. CRC Press, Boca Raton (2018)"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-79992-4_62","volume-title":"Cellular Automata","author":"M Szaban","year":"2008","unstructured":"Szaban, M., Seredynski, F.: Cryptographically strong S-boxes based on cellular automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 478\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79992-4_62"},{"issue":"2","key":"1_CR66","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S1568-4946(01)00015-1","volume":"1","author":"M Tomassini","year":"2001","unstructured":"Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Appl. Soft Comput. 1(2), 151\u2013160 (2001)","journal-title":"Appl. Soft Comput."},{"key":"1_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-39799-X_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"S Wolfram","year":"1986","unstructured":"Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429\u2013432. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_32"}],"container-title":["Lecture Notes in Computer Science","Security and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98795-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T19:47:59Z","timestamp":1726948079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98795-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030987947","9783030987954"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98795-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}