{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:35:41Z","timestamp":1768772141667,"version":"3.49.0"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T00:00:00Z","timestamp":1690588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T00:00:00Z","timestamp":1690588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one should consider and cryptographic properties that need to be fulfilled makes the search for new Boolean functions still a very active domain. There are several options to construct appropriate Boolean functions: algebraic constructions, random search, and metaheuristics. In this work, we concentrate on metaheuristic approaches and examine the related works appearing in the last 25 years. To the best of our knowledge, this is the first survey work on this topic. Additionally, we provide a new taxonomy of related works and discuss the results obtained. Finally, we finish this survey with potential future research directions.<\/jats:p>","DOI":"10.1007\/s12095-023-00662-2","type":"journal-article","created":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T03:18:02Z","timestamp":1690600682000},"page":"1171-1197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A survey of metaheuristic algorithms for the design of cryptographic Boolean functions"],"prefix":"10.1007","volume":"15","author":[{"given":"Marko","family":"Djurasevic","sequence":"first","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,29]]},"reference":[{"key":"662_CR1","doi-asserted-by":"crossref","unstructured":"Aguirre, H., Okazaki, H., Fuwa, Y.: An evolutionary multiobjective approach to design highly non-linear boolean functions. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201907, page 749-756, New York, NY, USA . Association for Computing Machinery (2007)","DOI":"10.1145\/1276958.1277112"},{"key":"662_CR2","doi-asserted-by":"crossref","unstructured":"Ashlock, D.: Finding designs with genetic algorithms. In Computational and Constructive Design Theory, pages 49\u201365. Springer, Boston, MA (1996)","DOI":"10.1007\/978-1-4757-2497-4_4"},{"issue":"1","key":"662_CR3","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s12065-020-00538-x","volume":"15","author":"PK Behera","year":"2022","unstructured":"Behera, P.K., Gangopadhyay, S.: An improved hybrid genetic algorithm to construct balanced boolean function with optimal cryptographic properties. Evol. Intell. 15(1), 639\u2013653 (2022)","journal-title":"Evol. Intell."},{"issue":"9","key":"662_CR4","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/12.954512","volume":"50","author":"A Bernasconi","year":"2001","unstructured":"Bernasconi, A., Codenotti, B., Vanderkam, J.M.: A characterization of bent functions in terms of strongly regular graphs. IEEE. Trans. Comput. 50(9), 984\u2013985 (2001)","journal-title":"IEEE. Trans. Comput."},{"key":"662_CR5","first-page":"231","volume":"29","author":"L Burnett","year":"2004","unstructured":"Burnett, L., Millan, W., Dawson, E., Clark, A.: Simpler methods for generating better boolean functions with good cryptographic properties. Australas. J. Combin. 29, 231\u2013248 (2004)","journal-title":"Australas. J. Combin."},{"key":"662_CR6","doi-asserted-by":"crossref","unstructured":"Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlationimmune functions. In J. Feigenbaum. (eds.) Advances in Cryptology-CRYPTO \u201991, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings, Lecture Notes in Computer Science,vol. 576, pp 86\u2013100. Springer (1991)","DOI":"10.1007\/3-540-46766-1_6"},{"key":"662_CR7","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)"},{"issue":"2","key":"662_CR8","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/TIT.2021.3126684","volume":"68","author":"C Carlet","year":"2022","unstructured":"Carlet, C.: A wide class of boolean functions generalizing the hidden weight bit function. IEEE Trans. Inf. Theory. 68(2), 1355\u20131368 (2022)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"662_CR9","doi-asserted-by":"crossref","unstructured":"Carlet, C., Djurasevic, M., Jakobovic, D., Mariot, L., Picek, S.: Evolving constructions for balanced, highly nonlinear boolean functions. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201922, page 1147\u20131155, New York, NY, USA. Association for Computing Machinery (2022)","DOI":"10.1145\/3512290.3528871"},{"key":"662_CR10","doi-asserted-by":"crossref","unstructured":"Carlet, C., Jakobovic, D., Picek, S.: Evolutionary algorithms-assisted construction of cryptographic boolean functions. In Chicano, F., Krawiec, K.(eds.) GECCO \u201921: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021, pages 565\u2013573. ACM (2021)","DOI":"10.1145\/3449639.3459362"},{"key":"662_CR11","doi-asserted-by":"crossref","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.) Information Security and Privacy, pages 242\u2013254, Berlin, Heidelberg, 2000. Springer Berlin Heidelberg (2000)","DOI":"10.1007\/10718964_20"},{"key":"662_CR12","doi-asserted-by":"crossref","unstructured":"Clark, J.A., Jacob, J.L., Maitra, S., Stanica, P.: Almost boolean functions: the design of boolean functions by spectral inversion. In The 2003 Congress on Evolutionary Computation, 2003. CEC \u201903., volume 3, pages 2173-2180 Vol.3 (2003)","DOI":"10.1109\/CEC.2003.1299941"},{"key":"662_CR13","doi-asserted-by":"crossref","unstructured":"J. A. Clark, J. L. Jacob, and S. Stepney. Searching for cost functions. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2004, 19-23 June 2004, Portland, OR, USA, pages 1517-1524. IEEE, (2004)","DOI":"10.1109\/CEC.2004.1331076"},{"key":"662_CR14","doi-asserted-by":"crossref","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S., Maitra, S., Millan, W.: Evolving boolean functions satisfying multiple criteria. In A. Menezes and P. Sarkar, editors, Progress in Cryptology - INDOCRYPT 2002, pages 246\u2013259, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg (2002)","DOI":"10.1007\/3-540-36231-2_20"},{"key":"662_CR15","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J.:CRC handbook of combinatorial designs. CRC press (2010)","DOI":"10.1201\/9781003040897"},{"key":"662_CR16","doi-asserted-by":"crossref","unstructured":"Darwin, C.: On the Origin of Species by Means of Natural Selection. Murray, London, 1859. or the Preservation of Favored Races in the Struggle for Life (1859)","DOI":"10.5962\/bhl.title.68064"},{"issue":"3","key":"662_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"L de Castro","year":"2002","unstructured":"de Castro, L., Von Zuben, F.: Learning and optimization using the clonal selection principle. IEEE. Trans. Evol. Comput. 6(3), 239\u2013251 (2002)","journal-title":"IEEE. Trans. Evol. Comput."},{"key":"662_CR18","unstructured":"Dillon, J.F.: Elementary Hadamard difference sets. PhD thesis, Univ. of Maryland (1974)"},{"key":"662_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer-Verlag, Berlin Heidelberg New York, USA, Berlin, Heidelberg (2003)"},{"key":"662_CR20","doi-asserted-by":"crossref","unstructured":"Fuller, J., Dawson, E., Millan, W.: Evolutionary generation of bent functions for cryptography. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, Canberra, Australia, December 8-12, 2003, pages 1655\u20131661. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299871"},{"key":"662_CR21","doi-asserted-by":"crossref","unstructured":"Glover, F.W., Kochenberger, G.A (ed.).: Handbook of Metaheuristics, volume 114 of International Series in Operations Research & Management Science. Springer, Boston, MA, 1 edition, Jan (2003)","DOI":"10.1007\/b101874"},{"key":"662_CR22","doi-asserted-by":"crossref","unstructured":"Hell, M., Johansson, T., Maximov, A., Meier, W.: A stream cipher proposal: Grain-128. In IEEE International Symposium on Information Theory, pages 1614\u20131618, July (2006)","DOI":"10.1109\/ISIT.2006.261549"},{"key":"662_CR23","doi-asserted-by":"crossref","unstructured":"Hrbacek, R., Dvorak, V.: Bent function synthesis by means of cartesian genetic programming. In T. Bartz-Beielstein, J. Branke, B. Filipi\u010d, and J. Smith, editors, Parallel Problem Solving from Nature - PPSN XIII, pages 414\u2013423, Cham, 2014. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-10762-2_41"},{"key":"662_CR24","doi-asserted-by":"crossref","unstructured":"Husa, J.: Designing correlation immune boolean functions with minimal hamming weight using various genetic programming methods. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO \u201919, page 342\u2013343, New York, NY, USA, 2019. Association for Computing Machinery (2019)","DOI":"10.1145\/3319619.3321925"},{"key":"662_CR25","doi-asserted-by":"crossref","unstructured":"Izbenko, Y.I., Kovtun, V., Kuznetsov, A.: The design of boolean functions by modified hill climbing method. In Latifi, S.(eds.) Sixth International Conference on Information Technology: New Generations, ITNG 2009, Las Vegas, Nevada, USA, 27-29 April 2009, pages 356-361. IEEE Computer Society (2009)","DOI":"10.1109\/ITNG.2009.102"},{"key":"662_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107327","volume":"107","author":"D Jakobovic","year":"2021","unstructured":"Jakobovic, D., Picek, S., Martins, M.S., Wagner, M.: Toward more efficient heuristic construction of boolean functions. Appl. Soft. Comput. 107, 107327 (2021)","journal-title":"Appl. Soft. Comput."},{"key":"662_CR27","unstructured":"Kavut, S.: Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra. PhD thesis, Middle East Technical University (2008)"},{"issue":"2\u20133","key":"662_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10623-018-0522-1","volume":"87","author":"S Kavut","year":"2019","unstructured":"Kavut, S., Maitra, S., Tang, D.: Construction and search of balanced boolean functions on even number of variables towards excellent autocorrelation profile. Des. Codes Cryptogr. 87(2\u20133), 261\u2013276 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"662_CR29","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TIT.2007.894696","volume":"53","author":"S Kavut","year":"2007","unstructured":"Kavut, S., Maitra, S., Yucel, M.D.: Search for boolean functions with excellent profiles in the rotation symmetric class. IEEE Trans. Inf. Theory. 53(5), 1743\u20131751 (2007)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"662_CR30","unstructured":"Kavut, S., Maitra, S., Y\u00fccel, M.D.: There exist boolean functions on n (odd) variables having nonlinearity $$ > 2^{n-1}-2 \\frac{n-1}{2}$$ if and only if n $$> 7$$. Cryptology ePrint Archive, Paper 2006\/181 (2006). https:\/\/eprint.iacr.org\/2006\/181"},{"key":"662_CR31","unstructured":"Kavut, S., Yucel, M.D., Maitra, S.: Construction of resilient functions by the concatenation of boolean functions having nonintersecting walsh spectra. In Third International Workshop on Boolean Functions: Cryptography and Applications (BFCA 2007) (2007)"},{"issue":"4","key":"662_CR32","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ic.2009.12.002","volume":"208","author":"S Kavut","year":"2010","unstructured":"Kavut, S., Y\u00fccel, M.D.: 9-variable boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Information and Computation. 208(4), 341\u2013350 (2010)","journal-title":"Information and Computation."},{"key":"662_CR33","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In Proceedings of ICNN\u201995 - International Conference on Neural Networks, volume 4, pages 1942\u20131948 vol.4 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"662_CR34","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science. 220(4598), 671\u2013680 (1983)","journal-title":"Science."},{"key":"662_CR35","doi-asserted-by":"crossref","unstructured":"K. Knezevic, S. Picek, L. Mariot, D. Jakobovic, and A. Leporati. The design of (almost) disjunct matrices by evolutionary algorithms. In Fagan, D., Mart\u00edn-Vide, C., O\u2019Neill, M., Vega-Rodr\u00edguez, M.A.(eds.) TPNC 2018, Proceedings, volume 11324 of Lecture Notes in Computer Science, pages 152\u2013163, Cham, Springer (2018)","DOI":"10.1007\/978-3-030-04070-3_12"},{"key":"662_CR36","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)"},{"issue":"9","key":"662_CR37","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.3390\/e22091052","volume":"22","author":"I L\u00f3pez-L\u00f3pez","year":"2020","unstructured":"L\u00f3pez-L\u00f3pez, I., G\u00f3mez, G.S., Segura, C., Oliva, D., Rojas, O.: Metaheuristics in the optimization of cryptographic boolean functions. Entropy. 22(9), 1052 (2020)","journal-title":"Entropy."},{"key":"662_CR38","first-page":"309","volume":"2007","author":"S Maitra","year":"2007","unstructured":"Maitra, S.: Balanced boolean function on 13-variables having nonlinearity strictly greater than the bent concatenation bound. IACR Cryptol. ePrint Arch. 2007, 309 (2007)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"662_CR39","doi-asserted-by":"crossref","unstructured":"Mandujano, S., Ku-Cauich, J.C., Lara, A.: Studying special operators for the application of evolutionary algorithms in the seek of optimal boolean functions for cryptography. In Pichardo-Lagunas, O., Mart\u00ednez-Miranda, J., Mart\u00ednez-Seis, B.(eds.) Advances in Computational Intelligence - 21st Mexican International Conference on Artificial Intelligence, MICAI 2022, Monterrey, Mexico, October 24-29, 2022, Proceedings, Part I, volume 13612 of Lecture Notes in Computer Science, pages 383-396, Cham, 2022. Springer (2022)","DOI":"10.1007\/978-3-031-19493-1_30"},{"key":"662_CR40","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":"662_CR41","doi-asserted-by":"crossref","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: Tip the balance: Improving exploration of balanced crossover operators by adaptive bias. In Ninth International Symposium on Computing and Networking, CANDAR 2021 - Workshops, Matsue, Japan, 23-26 November 2021, pages 234-240. IEEE (2021)","DOI":"10.1109\/CANDARW53999.2021.00046"},{"key":"662_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-031-21094-5_17","volume-title":"Bioinspired Optimization Methods and Their Applications - 10th International Conference, BIOMA 2022, Maribor, Slovenia, November 17\u201318, 2022, Proceedings","author":"L Manzoni","year":"2022","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: The influence of local search on genetic algorithms with balanced representations. In: Mernik, M., Eftimov, T., Crepinsek, M. (eds.) Bioinspired Optimization Methods and Their Applications - 10th International Conference, BIOMA 2022, Maribor, Slovenia, November 17\u201318, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13627, pp. 232\u2013246. Springer, Cham (2022)"},{"key":"662_CR43","unstructured":"Mariot, L.: Deriving smaller orthogonal arrays from bigger ones with genetic algorithm. CoRR, abs\/2111.13047 (2021)"},{"key":"662_CR44","doi-asserted-by":"crossref","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.) Genetic Programming, pages 262\u2013277, Cham, 2019. Springer International Publishing (2019)","DOI":"10.1007\/978-3-030-16670-0_17"},{"key":"662_CR45","doi-asserted-by":"crossref","unstructured":"Mariot, L., Leporati, A.: A genetic algorithm for evolving plateaued cryptographic boolean functions. In A.-H. Dediu, L. Magdalena, and C. Mart\u00edn-Vide, editors, Theory and Practice of Natural Computing, pages 33\u201345, Cham, 2015. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-26841-5_3"},{"key":"662_CR46","doi-asserted-by":"crossref","unstructured":"Mariot, L., Leporati, A.: Heuristic search by particle swarm optimization of boolean functions for cryptographic applications. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion \u201915, page 1425-1426, New York, NY, USA, 2015. Association for Computing Machinery (2015)","DOI":"10.1145\/2739482.2764674"},{"key":"662_CR47","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: Evolutionary construction of perfectly balanced boolean functions. In 2022 IEEE Congress on Evolutionary Computation (CEC), page 1\u20138. IEEE Press (2022)","DOI":"10.1109\/CEC55065.2022.9870427"},{"key":"662_CR48","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: On the difficulty of evolving permutation codes. In Applications of Evolutionary Computation, pages 141\u2013156. Springer International Publishing (2022)","DOI":"10.1007\/978-3-031-02462-7_10"},{"key":"662_CR49","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata. In Bosman, P.A.N.(eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, July 15-19, 2017, pages 306\u2013313, New York, NY, USA, ACM (2017)","DOI":"10.1145\/3071178.3071284"},{"key":"662_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-319-99253-2_10","volume-title":"Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8\u201312, 2018, Proceedings, Part I","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, L.D. (eds.) Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8\u201312, 2018, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11101, pp. 121\u2013133. Springer, Cham (2018)"},{"issue":"3","key":"662_CR51","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11047-022-09885-3","volume":"21","author":"L Mariot","year":"2022","unstructured":"Mariot, L., Saletta, M., Leporati, A., Manzoni, L.: Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput. 21(3), 377\u2013391 (2022)","journal-title":"Nat. Comput."},{"key":"662_CR52","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). https:\/\/eprint.iacr.org\/2013\/011"},{"key":"662_CR53","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.X., Carlet, C.: Towards stream ciphers for efficient fhe with low-noise ciphertexts. In: Advances in Cryptology- EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Vienna, Austria, May 8\u201312, 2016, pp. 311\u2013343. Heidelberg, Springer, Berlin (2016)","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"662_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32595-8","volume-title":"Bent Functions","author":"S Mesnager","year":"2016","unstructured":"Mesnager, S.: Bent Functions. Springer International Publishing, Cham (2016)"},{"key":"662_CR55","doi-asserted-by":"crossref","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.) Information and Communications Security, pages 149\u2013158, Berlin, Heidelberg, 1997. Springer Berlin Heidelberg (1997)","DOI":"10.1007\/BFb0028471"},{"key":"662_CR56","unstructured":"Millan, W., Clark, A., Dawson, E.: Smart hill climbing finds better boolean functions. In Workshop on Selected Areas in Cryptology, volume 63. Citeseer (1997)"},{"key":"662_CR57","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology - 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.) Advances in Cryptology - EUROCRYPT\u201998, pp. 489\u2013499. Springer, Berlin Heidelberg, Berlin, Heidelberg (1998)"},{"key":"662_CR58","first-page":"1","volume-title":"Information Security and Privacy","author":"W Millan","year":"1999","unstructured":"Millan, W., Clark, A., Dawson, E.: Boolean function design using hill climbing methods. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds.) Information Security and Privacy, pp. 1\u201311. Heidelberg, Springer, Berlin Heidelberg, Berlin (1999)"},{"key":"662_CR59","doi-asserted-by":"crossref","unstructured":"Moskovchenko, I., Pastukhov, M., Kuznetsov, A., Kuznetsova, T., Prokopenko, V., Kropyvnytskyi, V.: Heuristic methods of hill climbing of cryptographic boolean functions. In 2018 International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S &T), pages 1-6. IEEE (2018)","DOI":"10.1109\/INFOCOMMST.2018.8632017"},{"issue":"6","key":"662_CR60","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TIT.1982.1056589","volume":"28","author":"J Olsen","year":"1982","unstructured":"Olsen, J., Scholtz, R., Welch, L.: Bent-function sequences. IEEE Trans. Inf. Theory. 28(6), 858\u2013864 (1982)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"662_CR61","doi-asserted-by":"crossref","unstructured":"K. Paterson. On codes with low peak-to-average power ratio for multicode cdma. Inf. Theory, IEEE Trans. on. 50, 550\u2013559, 04 (2004)","DOI":"10.1109\/TIT.2004.825505"},{"key":"662_CR62","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-319-10762-2_80","volume-title":"Parallel Problem Solving from Nature - 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.) Parallel Problem Solving from Nature - PPSN XIII, pp. 812\u2013821. Springer International Publishing, Cham (2014)"},{"issue":"4","key":"662_CR63","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1162\/EVCO_a_00190","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Carlet, C., Guilley, S., Miller, J.F., Jakobovic, D.: Evolutionary algorithms for boolean functions in diverse domains of cryptography. Evolutionary Computation. 24(4), 667\u2013694 (2016)","journal-title":"Evolutionary Computation."},{"key":"662_CR64","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 the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO \u201915, page 1095-1102, New York, NY, USA, Association for Computing Machinery (2015)","DOI":"10.1145\/2739480.2754764"},{"key":"662_CR65","doi-asserted-by":"crossref","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.C., Mart\u00edn-Vide (eds.) Theory and Practice of Natural Computing, pages 71-82, Cham, Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-26841-5_6"},{"key":"662_CR66","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D.: Evolving algebraic constructions for designing bent boolean functions. In Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO \u201916, page 781-788, New York, NY, USA, Association for Computing Machinery (2016)","DOI":"10.1145\/2908812.2908915"},{"key":"662_CR67","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D., Golub, M.: Evolving cryptographically sound boolean functions. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO \u201913 Companion, page 191-192, New York, NY, USA, Association for Computing Machinery (2013)","DOI":"10.1145\/2464576.2464671"},{"key":"662_CR68","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":"662_CR69","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-16501-1_16","volume-title":"Genetic Programming","author":"S Picek","year":"2015","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Marchiori, E., Batina, L.: Evolutionary methods for the construction of cryptographic boolean functions. In: Machado, P., Heywood, M.I., McDermott, J., Castelli, M., Garc\u00eda-S\u00e1nchez, P., Burelli, P., Risi, S., Sim, K. (eds.) Genetic Programming, pp. 192\u2013204. Springer International Publishing, Cham (2015)"},{"key":"662_CR70","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, July 8-13, 2018, pages 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"662_CR71","doi-asserted-by":"crossref","unstructured":"Picek, S., Marchiori, E., Batina, L., Jakobovic, D.: Combining evolutionary computation and algebraic constructions to find cryptographyrelevant boolean functions. In Bartz-Beielstein, T., Branke, J., Filipic, B., Smith, J.(eds) Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings, volume 8672 of Lecture Notes in Computer Science, pages 822\u2013831. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_81"},{"key":"662_CR72","doi-asserted-by":"crossref","unstructured":"Picek, S., McKay, R.I., Santana, R., Gedeon, T.D.: Fighting the symmetries: The structure of cryptographic boolean function spaces. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO \u201915, page 457-464, New York, NY, USA. Association for Computing Machinery (2015)","DOI":"10.1145\/2739480.2754739"},{"key":"662_CR73","doi-asserted-by":"crossref","unstructured":"Picek, S., Santana, R., Jakobovic, D.: Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited. In 2016 IEEE Congress on Evolutionary Computation (CEC), 3222\u20133229 (2016)","DOI":"10.1109\/CEC.2016.7744197"},{"key":"662_CR74","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.11.002","volume":"62","author":"S Picek","year":"2017","unstructured":"Picek, S., Sisejkovic, D., Jakobovic, D.: Immunological algorithms paradigm for construction of boolean functions with good cryptographic properties. Eng. Appl. Artif. Intell. 62, 320\u2013330 (2017)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"662_CR75","volume-title":"A Field Guide to Genetic Programming","author":"R Poli","year":"2008","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises, UK Ltd (2008)"},{"issue":"3","key":"662_CR76","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O Rothaus","year":"1976","unstructured":"Rothaus, O.: On \u201cbent\u2019\u2019. J. Comb. Theory. Series A. 20(3), 300\u2013305 (1976)","journal-title":"J. Comb. Theory. Series A."},{"issue":"5","key":"662_CR77","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. Information Theory. 52(5), 2269\u20132270 (2006)","journal-title":"IEEE Trans. Information Theory."},{"key":"662_CR78","volume-title":"The use of genetic algorithms in the construction of mixed multilevel orthogonal arrays","author":"R Safadi","year":"1992","unstructured":"Safadi, R., Wang, R.: The use of genetic algorithms in the construction of mixed multilevel orthogonal arrays. Technical report, OLIN CORP CHESHIRE CT OLIN RESEARCH CENTER (1992)"},{"key":"662_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-25937-4_11","volume-title":"Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, February 5\u20137, 2004, Revised Papers","author":"P Stanica","year":"2004","unstructured":"Stanica, P., Maitra, S., Clark, J.A.: Results on rotation symmetric bent and correlation immune boolean functions. In: Roy, B.K., Meier, W. (eds.) Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, February 5\u20137, 2004, Revised Papers. Lecture Notes in Computer Science, vol. 3017, pp. 161\u2013177. Heidelberg, Springer, Berlin (2004)"},{"key":"662_CR80","volume-title":"Combinatorial designs - constructions and analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial designs - constructions and analysis. Springer, New York, NY (2004)"},{"key":"662_CR81","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley Publishing (2009)","DOI":"10.1002\/9780470496916"},{"key":"662_CR82","unstructured":"Uddin, M.F.: Artificial life techniques for cryptology. Master\u2019s thesis, Concordia University (2006)"},{"key":"662_CR83","doi-asserted-by":"crossref","unstructured":"Wang, R., Safadi, R.: Generating mixed multilevel orthogonal arrays by simulated annealing. In Computing Science and Statistics, pages 557\u2013560. Springer, New York, NY (1992)","DOI":"10.1007\/978-1-4612-2856-1_100"},{"key":"662_CR84","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gao, G., Yuan, Q.: Searching for cryptographically significant rotation symmetric boolean functions by designing heuristic algorithms. Security and Communication Networks, 2022 (2022)","DOI":"10.1155\/2022\/8188533"},{"key":"662_CR85","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Pieprzyk, J., Seberry, J.: HAVAL - a one-way hashing algorithm with variable length of output (extended abstract). In: Advances in Cryptology - AUSCRYPT \u201992: Workshop on the Theory and Application of Cryptographic Techniques Gold Coast. Queensland, Australia, December 13\u201316, 1992 Proceedings, pp. 81\u2013104. Springer, Berlin, Heidelberg (1993)","DOI":"10.1007\/3-540-57220-1_54"},{"key":"662_CR86","doi-asserted-by":"crossref","unstructured":"Zufiria, P.J., \u00c1lvarez-Cubero, J.A.: Generalized lexicographic multiobjective combinatorial optimization. application to cryptography. SIAM J. Opt. 27(4), 2182\u20132201 (2017)","DOI":"10.1137\/16M1107826"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00662-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00662-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00662-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T08:20:02Z","timestamp":1729844402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00662-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,29]]},"references-count":86,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["662"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00662-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,29]]},"assertion":[{"value":"15 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}