Pub Date : 2022-05-30DOI: 10.1007/978-3-031-14926-9_30
F. Bagnoli, Guido de Bonfioli Cavalcabo'
{"title":"A Simple Model of Knowledge Percolation","authors":"F. Bagnoli, Guido de Bonfioli Cavalcabo'","doi":"10.1007/978-3-031-14926-9_30","DOIUrl":"https://doi.org/10.1007/978-3-031-14926-9_30","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-18DOI: 10.48550/arXiv.2205.08972
Yonatan Nakar, D. Ron
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express the structure of the possible configurations that could emerge in this setting. Our main finding is that apart from the configurations of the form $ (0^{r+1}0^* + 1^{r+1}1^*)^* $, which are always fixed-points, the other configurations that the automata could possibly converge to, which are known to be either fixed-points or 2-cycles, have a particular spatially periodic structure. Namely, each of these configurations is of the form $ s^* $ where $ s $ consists of $ O(r^2) $ consecutive sequences of cells with the same state, each such sequence is of length at most $ r $, and the total length of $ s $ is $ O(r^2) $ as well. We show that an analogous result also holds for the minority rule.
研究了具有周期性边界条件的(同步)一维元胞自动机的动力学问题，这些边界条件以半径$ r $为多数规则。我们引入了一个概念，我们称之为细胞稳定性，我们用它来表达在这种情况下可能出现的构型结构。我们的主要发现是除了$ (0^{r+1}0^* +1 ^{r+1}1^*)^* $形式的构型总是不动点外，自动机可能收敛到的其他构型，已知是不动点或2周期，具有特定的空间周期结构。也就是说，每一种构型都是$ s^* $的形式，其中$ s $由$ O(r^2) $连续的具有相同状态的单元序列组成，每个这样的序列的长度最多为$ r $，并且$ s $的总长度为$ O(r^2) $。我们证明了一个类似的结果也适用于少数人规则。
{"title":"The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity","authors":"Yonatan Nakar, D. Ron","doi":"10.48550/arXiv.2205.08972","DOIUrl":"https://doi.org/10.48550/arXiv.2205.08972","url":null,"abstract":"We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express the structure of the possible configurations that could emerge in this setting. Our main finding is that apart from the configurations of the form $ (0^{r+1}0^* + 1^{r+1}1^*)^* $, which are always fixed-points, the other configurations that the automata could possibly converge to, which are known to be either fixed-points or 2-cycles, have a particular spatially periodic structure. Namely, each of these configurations is of the form $ s^* $ where $ s $ consists of $ O(r^2) $ consecutive sequences of cells with the same state, each such sequence is of length at most $ r $, and the total length of $ s $ is $ O(r^2) $ as well. We show that an analogous result also holds for the minority rule.","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121927030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-27DOI: 10.48550/arXiv.2203.14365
L. Mariot, L. Manzoni
We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thus be interesting for the design of block ciphers. In particular, we perform an exhaustive search of all nonlinear OCA pairs of diameter $d=4$ and $d=5$, which generate S-boxes of size $6times 6$ and $8times 8$, respectively. Surprisingly, all these S-boxes turn out to be linear, and thus they are not useful for the design of confusion layers in block ciphers. However, a closer inspection of these S-boxes reveals a very interesting structure. Indeed, we remark that the linear components space of the OCA-based S-boxes found by our exhaustive search are themselves the kernels of linear CA, or, equivalently, emph{polynomial codes}. We finally classify the polynomial codes of the S-boxes obtained in our exhaustive search and observe that, in most cases, they actually correspond to the cyclic code with generator polynomial $X^{b}+1$, where $b=d-1$. Although these findings rule out the possibility of using OCA to design good S-boxes in block ciphers, they give nonetheless some interesting insights for a theoretical characterization of nonlinear OCA pairs, which is still an open question in general.
{"title":"On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata","authors":"L. Mariot, L. Manzoni","doi":"10.48550/arXiv.2203.14365","DOIUrl":"https://doi.org/10.48550/arXiv.2203.14365","url":null,"abstract":"We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thus be interesting for the design of block ciphers. In particular, we perform an exhaustive search of all nonlinear OCA pairs of diameter $d=4$ and $d=5$, which generate S-boxes of size $6times 6$ and $8times 8$, respectively. Surprisingly, all these S-boxes turn out to be linear, and thus they are not useful for the design of confusion layers in block ciphers. However, a closer inspection of these S-boxes reveals a very interesting structure. Indeed, we remark that the linear components space of the OCA-based S-boxes found by our exhaustive search are themselves the kernels of linear CA, or, equivalently, emph{polynomial codes}. We finally classify the polynomial codes of the S-boxes obtained in our exhaustive search and observe that, in most cases, they actually correspond to the cyclic code with generator polynomial $X^{b}+1$, where $b=d-1$. Although these findings rule out the possibility of using OCA to design good S-boxes in block ciphers, they give nonetheless some interesting insights for a theoretical characterization of nonlinear OCA pairs, which is still an open question in general.","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124791159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_9
Antonio Carrieri, L. Crociani, Giuseppe Vizzari, S. Bandini
{"title":"Motion Detection and Characterization in Videos with Cellular Automata","authors":"Antonio Carrieri, L. Crociani, Giuseppe Vizzari, S. Bandini","doi":"10.1007/978-3-319-99813-8_9","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_9","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126718627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_21
P. Wagner, Johannes Rummel
{"title":"A Microscopic CA Model of Traffic Flow?","authors":"P. Wagner, Johannes Rummel","doi":"10.1007/978-3-319-99813-8_21","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_21","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122751660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_16
A. Lawniczak, Fei Yu
{"title":"Analysis of Rates of Agents' Decisions in Learning to Cross a Highway in Populations with Risk Takers and Risk Avoiders","authors":"A. Lawniczak, Fei Yu","doi":"10.1007/978-3-319-99813-8_16","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_16","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123525943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_31
Martin Kutrib, T. Worsch
{"title":"Self-verifying Cellular Automata","authors":"Martin Kutrib, T. Worsch","doi":"10.1007/978-3-319-99813-8_31","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_31","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124790260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_32
Rohit Lakra, Anita John, J. Jose
{"title":"CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher","authors":"Rohit Lakra, Anita John, J. Jose","doi":"10.1007/978-3-319-99813-8_32","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_32","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_41
Grzegorz Bazior, D. Pałka, Jarosław Wąs
{"title":"Cellular Automata Based Modeling of Competitive Evacuation","authors":"Grzegorz Bazior, D. Pałka, Jarosław Wąs","doi":"10.1007/978-3-319-99813-8_41","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_41","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130716381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-17DOI: 10.1007/978-3-319-99813-8_28
S. D. Gregorio
{"title":"The Representation Role for Basic Operations Embodied in Cellular Automata: A Suitability Example for Addition in Redundant Numeral Systems vs Conventional Ones","authors":"S. D. Gregorio","doi":"10.1007/978-3-319-99813-8_28","DOIUrl":"https://doi.org/10.1007/978-3-319-99813-8_28","url":null,"abstract":"","PeriodicalId":362847,"journal":{"name":"International Conference on Cellular Automata for Research and Industry","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129229299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：