{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:47:52Z","timestamp":1743101272764,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030415785"},{"type":"electronic","value":"9783030415792"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41579-2_24","type":"book-chapter","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T16:09:09Z","timestamp":1581955749000},"page":"413-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Steepest Ascent Hill-Climbing for High Nonlinear Boolean and Vectorial Boolean Functions (S-Boxes)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1055-0455","authenticated-orcid":false,"given":"Athmane","family":"Seghier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5152-0055","authenticated-orcid":false,"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,18]]},"reference":[{"key":"24_CR1","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/TIT.2002.1013128","volume-title":"Sequences and their Applications","author":"S Maitra","year":"2002","unstructured":"Maitra, S., Pasalic, E.: Further constructions of resilient Boolean functions with very high nonlinearity. In: Helleseth, T., Kumar, P.V., Yang, K. (eds.) Sequences and their Applications. DISCMATH, pp. 265\u2013280. Springer, London (2002). https:\/\/doi.org\/10.1109\/TIT.2002.1013128"},{"unstructured":"Millan, W., Clark, A., Dawson, E.: Smart hill climbing finds better boolean functions. In: Workshop on Selected Areas in Cryptology 1997, Workshop Record, pp. 50\u201363 (1997)","key":"24_CR2"},{"key":"24_CR3","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":"24_CR4","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":"24_CR5","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"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BFb0053732","volume-title":"Information Security and Privacy","author":"W Millan","year":"1998","unstructured":"Millan, W.: How to improve the nonlinearity of bijective S-boxes. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 181\u2013192. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053732"},{"key":"24_CR7","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":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael. AES - The Advanced Encryption Algorithm","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael. AES - The Advanced Encryption Algorithm. Springer, Berlin (2002)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-39887-5_7","volume-title":"Fast Software Encryption","author":"J Fuller","year":"2003","unstructured":"Fuller, J., Millan, W.: Linear redundancy in S-boxes. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 74\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_7"},{"doi-asserted-by":"crossref","unstructured":"Fuller, J., Millan, W.: On linear Redundancy in the AES S-Box (2002)","key":"24_CR10","DOI":"10.1007\/978-3-540-39887-5_7"},{"key":"24_CR11","first-page":"23","volume":"19","author":"P Tesa\u0159","year":"2010","unstructured":"Tesa\u0159, P.: A new method for generating high non-linearity S-boxes. Radioengineering 19, 23\u201326 (2010)","journal-title":"Radioengineering"},{"doi-asserted-by":"publisher","unstructured":"Gao, S., Ma, W., Feng, J., Guo, N., Yan, Y.: Improved hill-climbing methods in the design of bijective S-boxes. In: 2010 Sixth International Conference on Natural Computation (ICNC), pp. 2378\u20132380 (2010). https:\/\/doi.org\/10.1109\/ICNC.2010.5584026","key":"24_CR12","DOI":"10.1109\/ICNC.2010.5584026"},{"key":"24_CR13","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, 247\u2013276 (2016). https:\/\/doi.org\/10.1007\/s12095-015-0170-5","journal-title":"Cryptogr. Commun."},{"key":"24_CR14","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, 219\u2013231 (2005). https:\/\/doi.org\/10.1007\/BF03037656","journal-title":"New Gener. Comput."},{"doi-asserted-by":"publisher","unstructured":"Xiangyang, X.: The block cipher for construction of S-boxes based on particle swarm optimization. In: 2010 2nd International Conference on Networking and Digital Society (ICNDS), pp. 612\u2013615 (2010). https:\/\/doi.org\/10.1109\/ICNDS.2010.5479283","key":"24_CR15","DOI":"10.1109\/ICNDS.2010.5479283"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.procs.2015.07.394","volume":"57","author":"M Ahmad","year":"2015","unstructured":"Ahmad, M., Bhatia, D., Hassan, Y.: A novel ant colony optimization based scheme for substitution box design. Procedia Comput. Sci. 57, 572\u2013580 (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.07.394","journal-title":"Procedia Comput. Sci."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00354-016-0302-2","volume":"34","author":"H Isa","year":"2016","unstructured":"Isa, H., Jamil, N., Z\u2019aba, M.R.: Construction of cryptographically strong S-boxes inspired by bee waggle dance. New Gener. Comput. 34, 221\u2013238 (2016). https:\/\/doi.org\/10.1007\/s00354-016-0302-2","journal-title":"New Gener. Comput."},{"key":"24_CR18","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, 695\u2013718 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00191","journal-title":"Evol. Comput."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11071-012-0646-1","volume":"71","author":"I Hussain","year":"2013","unstructured":"Hussain, I., Shah, T., Gondal, M.A., Mahmood, H.: An efficient approach for the construction of LFT S-boxes using chaotic logistic map. Nonlinear Dyn. 71, 133\u2013140 (2013). https:\/\/doi.org\/10.1007\/s11071-012-0646-1","journal-title":"Nonlinear Dyn."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.physleta.2012.01.009","volume":"376","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Wong, K., Li, C., Li, Y.: A novel method to design S-box based on chaotic map and genetic algorithm. Phys. Lett. A 376, 827\u2013833 (2012). https:\/\/doi.org\/10.1016\/j.physleta.2012.01.009","journal-title":"Phys. Lett. A"},{"doi-asserted-by":"publisher","unstructured":"Yong, W., Peng, L., Yong, W.: An improved method to obtaining S-box based on chaos and genetic algorithm. 3733 (2015). https:\/\/doi.org\/10.1080\/1023697X.2012.10669006","key":"24_CR21","DOI":"10.1080\/1023697X.2012.10669006"},{"doi-asserted-by":"publisher","unstructured":"Wang, Y., Lei, P.: A method for constructing bijective S-box with high nonlinearity based on chaos and optimization. 25, 1\u201315 (2015). https:\/\/doi.org\/10.1142\/S0218127415501278","key":"24_CR22","DOI":"10.1142\/S0218127415501278"},{"doi-asserted-by":"publisher","unstructured":"Seghier, A.: Progressive two-bits tweak for linear redundancy reduction from finite field S-boxes. In: Proceedings of the 8th International Conference on Communication and Network Security, pp. 50\u201355 (2018). https:\/\/doi.org\/10.1145\/3290480.3290490","key":"24_CR23","DOI":"10.1145\/3290480.3290490"},{"doi-asserted-by":"crossref","unstructured":"Carlet, C.: Vectorial boolean function Cryptography. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering (2010)","key":"24_CR24","DOI":"10.1017\/CBO9780511780448.012"},{"doi-asserted-by":"publisher","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), pp. 3222\u20133229 (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7744197","key":"24_CR25","DOI":"10.1109\/CEC.2016.7744197"},{"key":"24_CR26","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. Comb. 29, 231\u2013248 (2004)","journal-title":"Australas. J. Comb."},{"doi-asserted-by":"publisher","unstructured":"Izbenko, Y., Kovtun, V., Kuznetsov, A.: The design of boolean functions by modified hill climbing method. In: 2009 Sixth International Conference on Information Technology: New Generations, pp. 356\u2013361 (2009). https:\/\/doi.org\/10.1109\/ITNG.2009.102","key":"24_CR27","DOI":"10.1109\/ITNG.2009.102"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41579-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T20:02:36Z","timestamp":1665864156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41579-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030415785","9783030415792"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41579-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2019","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":"icics2019","order":10,"name":"conference_id","label":"Conference ID","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"199","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":"47","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":"24% - 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":"8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}