{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:53:36Z","timestamp":1742979216290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030615871"},{"type":"electronic","value":"9783030615888"}],"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-61588-8_11","type":"book-chapter","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:04:36Z","timestamp":1603235076000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Latin Hypercubes and Cellular Automata"],"prefix":"10.1007","author":[{"given":"Maximilien","family":"Gadouleau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Managing Requirements Knowledge, International Workshop on, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1515\/crll.1960.203.47","volume":"203","author":"D Daykin","year":"1960","unstructured":"Daykin, D.: Distribution of bordered persymmetric matrices in a finite field. J. Reine Angew. Math. (Crelle\u2019s J.) 203, 47\u201354 (1960)","journal-title":"J. Reine Angew. Math. (Crelle\u2019s J.)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.jcta.2010.11.005","volume":"118","author":"M Garc\u00eda-Armas","year":"2011","unstructured":"Garc\u00eda-Armas, M., Ghorpade, S.R., Ram, S.: Relatively prime polynomials and nonsingular Hankel matrices over finite fields. J. Comb. Theory Ser. A 118(3), 819\u2013828 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"key":"11_CR4","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":"2","key":"11_CR5","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":"11_CR6","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"},{"issue":"3","key":"11_CR7","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":"11_CR8","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":"11","key":"11_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"11_CR10","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":"1","key":"11_CR11","first-page":"19","volume":"5","author":"K Sutner","year":"1991","unstructured":"Sutner, K.: De Bruijn graphs and linear cellular automata. Complex Syst. 5(1), 19\u201330 (1991)","journal-title":"Complex Syst."}],"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-030-61588-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T23:03:04Z","timestamp":1729465384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61588-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030615871","9783030615888"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61588-8_11","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":"21 October 2020","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":"Stockholm","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2020.weebly.com\/","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":"21","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":"11","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":"52% - 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-4","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-3","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)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}