乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:04:19Z","timestamp":1725667459351},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031700842","type":"print"},{"value":"9783031700859","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-70085-9_27","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"429-445","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Rotation Symmetric Self-dual Bent Functions with\u00a0Evolutionary Algorithms"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8373-9200","authenticated-orcid":false,"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8732-4769","authenticated-orcid":false,"given":"Marko","family":"\u00d0urasevic","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9201-2994","authenticated-orcid":false,"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7509-4337","authenticated-orcid":false,"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"27_CR1","unstructured":"Brownlee, J., et al.: Clonal selection algorithms. Complex Intelligent Systems Laboratory, Swinburne University of Technology, Australia (2007). https:\/\/researchbank.swinburne.edu.au\/file\/c0a1d68c-8126-4a20-a530-eb6cb2cdd636\/1\/PDF technical Report 070209A"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108606806","DOI":"10.1017\/9781108606806"},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Carlet, C., Durasevic, M., Gasperov, B., Jakobovic, D., Mariot, L., Picek, S.: A new angle: on evolving rotation symmetric boolean functions. In: Smith, S.L., Correia, J., Cintrano, C. (eds.) Applications of Evolutionary Computation - 27th European Conference, EvoApplications 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3-5 (2024), Proceedings, Part I. Lecture Notes in Computer Science, vol. 14634, pp. 287\u2013302. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-56852-7_19","DOI":"10.1007\/978-3-031-56852-7_19"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-031-56957-9_10","volume-title":"Genetic Programming","author":"C Carlet","year":"2024","unstructured":"Carlet, C., Durasevic, M., Jakobovic, D., Mariot, L., Picek, S.: Look into the mirror: Evolving self-dual bent boolean functions. In: Giacobini, M., Xue, B., Manzoni, L. (eds.) Genetic Programming, pp. 161\u2013175. Springer Nature Switzerland, Cham (2024)"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Cryptography 78(1), 5\u201350 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0145-8, http:\/\/dx.doi.org\/10.1007\/s10623-015-0145-8","DOI":"10.1007\/s10623-015-0145-8"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cutello, V., Nicosia, G., Pavone, M.: Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator. In: Proceedings of the 2006 ACM Symposium on Applied computing, pp. 950\u2013954 (2006)","DOI":"10.1145\/1141277.1141501"},{"key":"27_CR7","doi-asserted-by":"publisher","unstructured":"Djurasevic, M., Jakobovic, D., Mariot, L., Picek, S.: A survey of metaheuristic algorithms for the design of cryptographic boolean functions. Cryptography Commun. 15(6), 1171\u20131197 (Jul 2023). https:\/\/doi.org\/10.1007\/s12095-023-00662-2","DOI":"10.1007\/s12095-023-00662-2"},{"key":"27_CR8","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, pp. 1655\u20131661. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299871"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-10762-2_41","volume-title":"Parallel Problem Solving from Nature - 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.) Parallel Problem Solving from Nature - PPSN XIII, pp. 414\u2013423. Springer International Publishing, Cham (2014)"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Husa, J., Dobai, R.: Designing bent Boolean functions with parallelized linear genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1825\u20131832. GECCO \u201917, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3067695.3084220","DOI":"10.1145\/3067695.3084220"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Jakobovic, D., \u0110urasevi\u0107, M., Picek, S., Ga\u0161perov, B.: ECF: A C++ framework for evolutionary computation. SoftwareX 27, 101640 (2024). https:\/\/doi.org\/10.1016\/j.softx.2024.101640, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352711024000116","DOI":"10.1016\/j.softx.2024.101640"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"27_CR14","doi-asserted-by":"publisher","unstructured":"Kavut, S., Y\u00fccel, M.D.: 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Inf. Comput. 208(4), 341\u2013350 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.12.002, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540109002454","DOI":"10.1016\/j.ic.2009.12.002"},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A Kerdock","year":"1972","unstructured":"Kerdock, A.: A class of low-rate nonlinear binary codes. Inf. Control 20(2), 182\u2013187 (1972)","journal-title":"Inf. Control"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/TIT.2008.2008140","volume":"55","author":"WM Liu","year":"2009","unstructured":"Liu, W.M., Youssef, A.: On the existence of $$(10, 2, 7, 488)$$ resilient functions. IEEE Trans. Inf. Theory 55(1), 411\u2013412 (2009). https:\/\/doi.org\/10.1109\/TIT.2008.2008140","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR17","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam, North Holland (1977). ISBN: 978-0-444-85193-2"},{"key":"27_CR18","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.) Genetic Programming, pp. 262\u2013277. Springer International Publishing, Cham (2019)"},{"key":"27_CR19","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"},{"issue":"3","key":"27_CR20","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":"27_CR21","doi-asserted-by":"publisher","unstructured":"Mesnager, S.: Bent Functions. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32595-8","DOI":"10.1007\/978-3-319-32595-8"},{"key":"27_CR22","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.) Information and Communications Security, pp. 149\u2013158. Springer, Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"issue":"6","key":"27_CR23","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":"27_CR24","doi-asserted-by":"publisher","first-page":"103479","DOI":"10.1016\/j.engappai.2020.103479","volume":"90","author":"M Pant","year":"2020","unstructured":"Pant, M., Zaheer, H., Garcia-Hernandez, L., Abraham, A., et al.: Differential evolution: a review of more than two decades of research. Eng. Appl. Artif. Intell. 90, 103479 (2020)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"27_CR25","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D.: Evolving algebraic constructions for designing bent Boolean functions. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 781\u2013788. GECCO \u201916, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2908812.2908915","DOI":"10.1145\/2908812.2908915"},{"key":"27_CR26","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D., Golub, M.: On the recombination operator in the real-coded genetic algorithms. In: 2013 IEEE Congress on Evolutionary Computation, pp. 3103\u20133110 (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557948","DOI":"10.1109\/CEC.2013.6557948"},{"key":"27_CR27","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, pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Rothaus, O.: \u201cOn bent\u201d functions. J. Comb. Theory, Ser. A 20(3), 300\u2013305 (1976)","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"27_CR29","doi-asserted-by":"publisher","unstructured":"St\u0103nic\u0103, P., Maitra, S.: Rotation symmetric Boolean functions-count and cryptographic properties. Discrete Appl. Math. 156(10), 1567\u20131580 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.04.029, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X07001734","DOI":"10.1016\/j.dam.2007.04.029"},{"key":"27_CR30","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 St\u0103nic\u0103","year":"2004","unstructured":"St\u0103nic\u0103, 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. Springer, Berlin, Heidelberg (2004)"},{"key":"27_CR31","doi-asserted-by":"publisher","unstructured":"Wang, Y., Gao, G., Yuan, Q.: Searching for cryptographically significant rotation symmetric boolean functions by designing heuristic algorithms. Secur. Commun. Netw. 2022, 1\u20136 (2022). https:\/\/doi.org\/10.1155\/2022\/8188533","DOI":"10.1155\/2022\/8188533"},{"key":"27_CR32","unstructured":"Yang, M., Meng, Q., Zhang, H.: Evolutionary design of trace form bent functions. Cryptology ePrint Archive, Paper 2005\/322 (2005). https:\/\/eprint.iacr.org\/2005\/322, https:\/\/eprint.iacr.org\/2005\/322"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70085-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:17:01Z","timestamp":1725650221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70085-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700842","9783031700859"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70085-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}