乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T22:53:46Z","timestamp":1726095226839},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58115-2_24","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"343-356","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Search for Additional Structure: The Case of Cryptographic S-boxes"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Marko","family":"Djurasevic","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-47555-9_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1992","author":"M Matsui","year":"1993","unstructured":"Matsui, M., Yamagishi, A.: A new method for known plaintext attack of FEAL cipher. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 81\u201391. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_7"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology-CRYPT0 1990","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2\u201321. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_1"},{"key":"24_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/9781108606806","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2020","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2020)"},{"key":"24_CR4","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 the Computing Frontiers Conference, CF 2017, New York, NY, USA, pp. 409\u2013414. ACM (2017)","DOI":"10.1145\/3075564.3079069"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-17993-9","volume-title":"Magic Squares","author":"JL Chabert","year":"1999","unstructured":"Chabert, J.L.: Magic Squares, pp. 49\u201381. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-030-17993-9"},{"key":"24_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-38162-6","volume-title":"Power Analysis Attacks: Revealing the Secrets of Smart Cards","author":"S Mangard","year":"2007","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks: Revealing the Secrets of Smart Cards. Springer, Boston, MA (2007). https:\/\/doi.org\/10.1007\/978-0-387-38162-6"},{"issue":"3","key":"24_CR7","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":"24_CR8","unstructured":"Picek, S., Cupic, M., Rotim, L.: A new cost function for evolution of s-boxes. Evol. Comput. 24(4), 695\u2013718 (2016). PMID: 27482748"},{"issue":"1","key":"24_CR9","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":"24_CR10","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: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, New York, NY, USA, pp. 285\u2013293. ACM (2019)","DOI":"10.1145\/3321707.3321850"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Picek, S., Ege, B., Batina, L., Jakobovic, D., Chmielewski, L., Golub, M.: On using genetic algorithms for intrinsic side-channel resistance: the case of AES s-box. In: Proceedings of the First Workshop on Cryptography and Security in Computing Systems, CS2 2014, New York, NY, USA, pp. 13\u201318. ACM (2014)","DOI":"10.1145\/2556315.2556319"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-47555-9_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1992","author":"K Nyberg","year":"1993","unstructured":"Nyberg, K.: On the construction of highly nonlinear permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92\u201398. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_8"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1991","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378\u2013386. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_32"},{"key":"24_CR14","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"},{"issue":"2","key":"24_CR15","first-page":"590","volume":"199","author":"T Kelleg\u00f6z","year":"2008","unstructured":"Kelleg\u00f6z, T., Toklu, B., Wilson, J.: Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Appl. Math. Comput. 199(2), 590\u2013598 (2008)","journal-title":"Appl. Math. Comput."},{"key":"24_CR16","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk (2008) (With contributions by J. R. Koza)"},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"Trans. Evol. Comput."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Abbott, S.: Most-perfect pandiagonal magic squares: their construction and enumeration, by kathleen ollerenshaw and david br\u00e9e, p. 172. \u00a319.50 (1998). ISBN 0 905091 06 x. (Institute of mathematics and its applications, 16 nelson st, southend-on-sea, ss1 1ef). The Mathematical Gazette 82(495), 535\u2013536(1998)","DOI":"10.2307\/3619932"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T12:38:44Z","timestamp":1617107924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-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":"2 September 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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":"2.2","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)"}}]}}