{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:46:18Z","timestamp":1759365978691,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032015693"},{"type":"electronic","value":"9783032015709"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-01570-9_13","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:03:23Z","timestamp":1759273403000},"page":"188-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-orthogonal Cellular Automata"],"prefix":"10.1007","author":[{"given":"Luca","family":"Mariot","sequence":"first","affiliation":[]},{"given":"Federico","family":"Mazzone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0012-365X(83)90003-1","volume":"44","author":"RD Baker","year":"1983","unstructured":"Baker, R.D.: Resolvable bibd and sols. Discret. Math. 44(1), 13\u201329 (1983)","journal-title":"Discret. Math."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BFb0055096","volume-title":"Automata, Languages and Programming","author":"D Bini","year":"1998","unstructured":"Bini, D., Del Corso, G.M., Manzini, G., Margara, L.: Inversion of circulant matrices over Z$$_{\\rm m}$$. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 719\u2013730. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055096"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(97)89208-6","volume":"77","author":"C Blundo","year":"1997","unstructured":"Blundo, C., Stinson, D.R.: Anonymous secret sharing schemes. Discret. Appl. Math. 77(1), 13\u201328 (1997)","journal-title":"Discret. Appl. Math."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press (2021)","DOI":"10.1017\/9781108606806"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1088\/0951-7715\/6\/6\/010","volume":"6","author":"K Eloranta","year":"1993","unstructured":"Eloranta, K.: Partially permutive cellular automata. Nonlinearity 6(6), 1009\u20131023 (1993)","journal-title":"Nonlinearity"},{"key":"13_CR6","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":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-022-01097-1","volume":"91","author":"M Gadouleau","year":"2023","unstructured":"Gadouleau, M., Mariot, L., Picek, S.: Bent functions in the partial spread class generated by linear recurring sequences. Des. Codes Cryptogr. 91(1), 63\u201382 (2023)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"13_CR8","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":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s10623-023-01200-0","volume":"91","author":"JM Hammer","year":"2023","unstructured":"Hammer, J.M., Lorch, J.: Diagonal cellular factor pair latin squares. Des. Codes Cryptogr. 91(6), 2309\u20132322 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-030-00434-7_23","volume-title":"Cryptology and Network Security","author":"J Herranz","year":"2018","unstructured":"Herranz, J., S\u00e1ez, G.: Secret sharing schemes for (k,\u00a0n)-consecutive access structures. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 463\u2013480. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_23"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0022-0000(83)90033-8","volume":"27","author":"M Ito","year":"1983","unstructured":"Ito, M., Osato, N., Nasu, M.: Linear cellular automata over $$\\mathbb{Z} _m$$. J. Comput. Syst. Sci. 27(1), 125\u2013140 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR12","unstructured":"Keedwell, A.D., D\u00e9nes, J.: Latin squares and their applications. Elsevier (2015)"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s12095-021-00537-4","volume":"14","author":"A Kumar","year":"2022","unstructured":"Kumar, A., Maitra, S.: Resolvable block designs in construction of approximate real MUBs that are sparse. Cryptogr. Commun. 14(3), 527\u2013549 (2022)","journal-title":"Cryptogr. Commun."},{"issue":"5\u20136","key":"13_CR14","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":"13_CR15","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press (1994)","DOI":"10.1017\/CBO9781139172769"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1006\/jcss.1997.1535","volume":"56","author":"G Manzini","year":"1998","unstructured":"Manzini, G., Margara, L.: Invertible linear cellular automata over z$$ _{\\text{ m }}$$: algorithmic and dynamical aspects. J. Comput. Syst. Sci. 56(1), 60\u201367 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-58631-1_12","volume-title":"Cellular Automata and Discrete Complex Systems","author":"L Mariot","year":"2017","unstructured":"Mariot, L., Formenti, E., Leporati, A.: Enumerating orthogonal Latin squares generated by bipermutive cellular automata. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) AUTOMATA 2017. LNCS, vol. 10248, pp. 151\u2013164. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58631-1_12"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10623-019-00689-8","volume":"88","author":"L Mariot","year":"2020","unstructured":"Mariot, L., Gadouleau, M., Formenti, E., Leporati, A.: Mutually orthogonal Latin squares based on cellular automata. Des. Codes Cryptogr. 88(2), 391\u2013411 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR19","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":"13_CR20","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11047-017-9635-0","volume":"17","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Leporati, A.: A cryptographic and coding-theoretic perspective on the global rules of cellular automata. Nat. Comput. 17, 487\u2013498 (2018)","journal-title":"Nat. Comput."},{"key":"13_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-031-42250-8_8","volume-title":"AUTOMATA 2023","author":"L Mariot","year":"2023","unstructured":"Mariot, L., Mazzone, F.: On the minimum distance of subspace codes generated by linear cellular automata. In: Manzoni, L., Mariot, L., Roy Chowdhury, D. (eds.) AUTOMATA 2023. LNCS, vol. 14152, pp. 105\u2013119. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42250-8_8"},{"issue":"1","key":"13_CR22","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":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/b15006","volume-title":"Handbook of Finite Fields","author":"GL Mullen","year":"2013","unstructured":"Mullen, G.L., Panario, D.: Handbook of Finite Fields, vol. 17. CRC Press, Boca Raton (2013)"},{"key":"13_CR24","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, Siena, Italy, 15\u201317 May 2017, pp. 409\u2013414. ACM (2017)","DOI":"10.1145\/3075564.3079069"},{"issue":"2","key":"13_CR25","first-page":"1356","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":"13_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/b97564","volume-title":"Combinatorial Designs - Constructions and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial Designs - Constructions and Analysis. Springer, New York (2004). https:\/\/doi.org\/10.1007\/b97564"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601 (1983)","journal-title":"Rev. Mod. Phys."},{"key":"13_CR28","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 and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01570-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:03:26Z","timestamp":1759273406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01570-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032015693","9783032015709"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01570-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata-wan-2025.univ-lille.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}