{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:33:33Z","timestamp":1769920413551,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031194924","type":"print"},{"value":"9783031194931","type":"electronic"}],"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-031-19493-1_30","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T06:03:14Z","timestamp":1666418594000},"page":"383-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Studying Special Operators for\u00a0the\u00a0Application of\u00a0Evolutionary Algorithms in\u00a0the\u00a0Seek of\u00a0Optimal Boolean Functions for\u00a0Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9305-9316","authenticated-orcid":false,"given":"Sara","family":"Mandujano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9347-5018","authenticated-orcid":false,"given":"Juan Carlos","family":"Ku Cauich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2498-4441","authenticated-orcid":false,"given":"Adriana","family":"Lara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-46796-3_10","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"C Carlet","year":"1999","unstructured":"Carlet, C., Guillot, P.: A new representation of Boolean functions. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds.) AAECC 1999. LNCS, vol. 1719, pp. 94\u2013103. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46796-3_10"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the flip cipher. Cryptology ePrint Archive (2017)","DOI":"10.46586\/tosc.v2017.i3.192-227"},{"key":"30_CR3","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"},{"key":"30_CR4","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., et al.: Introduction to Evolutionary Computing, vol. 53. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-05094-1"},{"key":"30_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9781351133036","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2020","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2020)"},{"issue":"9","key":"30_CR6","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., Sosa-G\u00f3mez, G., Segura, C., Oliva, D., Rojas, O.: Metaheuristics in the optimization of cryptographic Boolean functions. Entropy 22(9), 1052 (2020)","journal-title":"Entropy"},{"key":"30_CR7","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)","DOI":"10.1016\/j.swevo.2020.100646"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: Evolutionary construction of perfectly balanced boolean functions. arXiv preprint arXiv:2202.08221 (2022)","DOI":"10.1109\/CEC55065.2022.9870427"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"issue":"6","key":"30_CR11","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/s12095-021-00481-3","volume":"13","author":"S Mesnager","year":"2021","unstructured":"Mesnager, S., Su, S.: On constructions of weightwise perfectly balanced Boolean functions. Cryptogr. Commun. 13(6), 951\u2013979 (2021)","journal-title":"Cryptogr. Commun."},{"key":"30_CR12","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":"30_CR13","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":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48970-3_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.) ACISP 1999. LNCS, vol. 1587, pp. 1\u201311. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48970-3_1"},{"issue":"3","key":"30_CR15","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. Comput. Intell. 20(3), 463\u2013474 (2004)","journal-title":"Comput. Intell."},{"issue":"4","key":"30_CR16","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. Evol. Comput. 24(4), 667\u2013694 (2016)","journal-title":"Evol. Comput."},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","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., et al. (eds.) EuroGP 2015. LNCS, vol. 9025, pp. 192\u2013204. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16501-1_16"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-48329-2_5","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"J Seberry","year":"1994","unstructured":"Seberry, J., Zhang, X.-M., Zheng, Y.: Nonlinearly balanced Boolean functions and their propagation characteristics. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 49\u201360. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_5"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-28270-1_17","volume-title":"Artificial Life and Computational Intelligence","author":"HK Singh","year":"2016","unstructured":"Singh, H.K., Alam, K., Ray, T.: Use of infeasible solutions during constrained evolutionary search: a short survey. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS (LNAI), vol. 9592, pp. 193\u2013205. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28270-1_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19493-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T07:06:58Z","timestamp":1666422418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19493-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031194924","9783031194931"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19493-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Monterrey","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 External reviewers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}