{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:30:33Z","timestamp":1765233033533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030694791"},{"type":"electronic","value":"9783030694807"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-69480-7_7","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T07:04:03Z","timestamp":1613113443000},"page":"56-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Exploring Semi-bent Boolean Functions Arising from Cellular Automata"],"prefix":"10.1007","author":[{"given":"Luca","family":"Mariot","sequence":"first","affiliation":[]},{"given":"Martina","family":"Saletta","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Leporati","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Manzoni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"key":"7_CR1","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference, January 2011. http:\/\/keccak.noekeon.org\/"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257\u2013397. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.011"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-13350-8_5","volume-title":"Computing with New Resources","author":"E Formenti","year":"2014","unstructured":"Formenti, E., Imai, K., Martin, B., Yun\u00e8s, J.-B.: Advances on random sequence generation by uniform cellular automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 56\u201370. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_5"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.46586\/tosc.v2018.i3.311-334","volume":"2018","author":"A Ghoshal","year":"2018","unstructured":"Ghoshal, A., Sadhukhan, R., Patranabis, S., Datta, N., Picek, S., Mukhopadhyay, D.: Lightweight and side-channel secure 4 $$\\times $$ 4 s-boxes from cellular automata rules. IACR Trans. Symmetric Cryptol. 2018(3), 311\u2013334 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"5\u20136","key":"7_CR5","first-page":"437","volume":"9","author":"A Leporati","year":"2014","unstructured":"Leporati, A., Mariot, L.: Cryptographic properties of bipermutive cellular automata rules. J. Cell. Autom. 9(5\u20136), 437\u2013475 (2014)","journal-title":"J. Cell. Autom."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-99813-8_39","volume-title":"Cellular Automata","author":"L Manzoni","year":"2018","unstructured":"Manzoni, L., Mariot, L.: Cellular automata pseudo-random number generators and their resistance to asynchrony. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99813-8_39"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10623-019-00689-8","volume":"88","author":"L Mariot","year":"2019","unstructured":"Mariot, L., Gadouleau, M., Formenti, E., Leporati, A.: Mutually orthogonal Latin squares based on cellular automata. Des. Codes Cryptogr. 88(2), 391\u2013411 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00689-8","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-11520-7_43","volume-title":"Cellular Automata","author":"L Mariot","year":"2014","unstructured":"Mariot, L., Leporati, A.: Sharing secrets by computing preimages of bipermutive cellular automata. In: W\u0105s, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 417\u2013426. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11520-7_43"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-99813-8_33","volume-title":"Cellular Automata","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Leporati, A.: Inversion of mutually orthogonal cellular automata. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 364\u2013376. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99813-8_33"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11047-016-9586-x","volume":"16","author":"L Mariot","year":"2016","unstructured":"Mariot, L., Leporati, A., Dennunzio, A., Formenti, E.: Computing the periods of preimages in surjective cellular automata. Nat. Comput. 16(3), 367\u2013381 (2016). https:\/\/doi.org\/10.1007\/s11047-016-9586-x","journal-title":"Nat. Comput."},{"issue":"1","key":"7_CR11","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."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1016\/j.amc.2005.01.026","volume":"170","author":"\u00c1M del Rey","year":"2005","unstructured":"del Rey, \u00c1.M., Mateus, J.P., S\u00e1nchez, G.R.: A secret sharing scheme based on cellular automata. Appl. Math. Comput. 170(2), 1356\u20131364 (2005)","journal-title":"Appl. Math. Comput."},{"key":"7_CR13","unstructured":"Rothaus, O.S.: On \u201cbent\u201d functions. J. Comb. Theory Ser. A 20(3), 300\u2013305 (1976)"},{"issue":"5\u20136","key":"7_CR14","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.parco.2003.12.014","volume":"30","author":"F Seredynski","year":"2004","unstructured":"Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Comput. 30(5\u20136), 753\u2013766 (2004)","journal-title":"Parallel Comput."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-79992-4_62","volume-title":"Cellular Automata","author":"M Szaban","year":"2008","unstructured":"Szaban, M., Seredynski, F.: Cryptographically strong s-boxes based on cellular automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 478\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79992-4_62"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-39799-X_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"S Wolfram","year":"1986","unstructured":"Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429\u2013432. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_32"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69480-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T07:12:32Z","timestamp":1613113952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69480-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030694791","9783030694807"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69480-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACRI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cellular Automata for Research and Industry","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lodz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"2 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acri2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/acri2020.uni.lodz.pl\/#main","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":"40","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":"24","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":"3","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":"60% - 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":"2","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","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)"}}]}}