• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.1
• /
• pp.235-242
• /
• 2019

Self-reciprocal polynomials over finite fields are useful in several applications, including reversible codes with read-backward properties. This paper is a study on 90/150 CA with characteristic polynomials of maximal weight polynomials, which is one of the self-reciprocal polynomials. In this paper, we propose a decision method for determining the existence of 90/150 MWCA corresponding to the maximum weight polynomial of degree 2n using n-cell 90/150 CA with transition rule <$100{\cdots}0$>. The proposed method is verified through experiments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1105-1112
• /
• 2020

One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

• Journal of Korea Multimedia Society
• /
• v.23 no.5
• /
• pp.710-720
• /
• 2020

Tsunami occurred by a rapid change in the ocean floor is a natural disaster that causes serious damage worldwide. South Korea seems to be out of the range of this damage, but it is quite possible that South Korea will fall within the range due to the long-distance propagation features of tsunami and many earthquakes occurred in Japan. However, the analysis and preparation for tsunami have been still insufficient. In this paper, we propose a tsunami simulation model based on cellular automata for analyzing coastal inundation. The proposed model calculates the range of inundation in coastal areas by propagating the energy of tsunami using the interaction between neighboring cells. We define interaction rules and algorithms for the energy transfer and propose a software tool to effectively utilize the model. In addition, to verify and tune the simulation model, we used the actual tsunami data in 2010 at Dichato, Chile. As a case study, the proposed model was applied to analyze the coastal inundation according to tsunami height in Gwangali Beach, a famous site in Busan. It is expected that the simulation model can be a help to prepare an effective countermeasure against tsunami and be used for a virtual evacuating training.

• Journal of Korea Multimedia Society
• /
• v.23 no.6
• /
• pp.772-783
• /
• 2020

Tsunami is a frightful natural disaster that causes severe damages worldwide. To minimize the damage, South Korea has built a tsunami warning system and designated evacuation sites in the east and south coasts. However, such countermeasures have not been verified whether they are adequate to minimize casualties since tsunami rarely occurs in South Korea. Recently, due to increasing earthquakes in the west coast of Japan, the likelihood of South Korea entering the damage area of tsunami rises; thus, in this paper, we develops a simulator based on Unity game engine to simulate the evacuation from tsunami. In order to increase the fidelity of the simulation results, the simulator applies a tsunami simulation model that analyzes coastal inundation based on cellular automata. In addition, the objects included in tsunami evacuation, such as humans, are modeled as an agent model that determines the situation and acts itself, based on the discrete-event system specification (DEVS), a mathematical formalism for describing a discrete event system. The tsunami simulation model and agent models are integrated and visualized in the simulator using Unity game engine. As an example of the use of this simulator, we verify the existing tsunami evacuation site in Gwangalli Beach in Busan and suggest the optimal alternative site minimizing casualties.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.293-302
• /
• 2016

In this paper we analyze the CA formed by combining the uniform 102 CA $\mathbb{C}_u$ and the m-cell 90/150 hybrid CA $\mathbb{C}_h$ whose characteristic polynomial is $(x+1)^m$. We analyze cycle structures of complemented group CA derived from $\mathbb{C}_u$ and propose a condition of complemented CA dividing the entire state space into smaller cycles of equal lengths. And we analyze the cycle structure of complemented group CA $\mathbb{C}^{\prime}$ derived from the CA $\mathbb{C}$ formed by combining $\mathbb{C}_u$ and $\mathbb{C}_h$ with complement vector F such that $(T+I)^{q-1}F{\neq}0$ where $(x+1)^q$ is the minimal polynomial of $\mathbb{C}$.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.2
• /
• pp.319-326
• /
• 2020

PRNGs(Pseudorandom number generators) are essential for generating encryption keys for to secure online communication. A bitstream generated by the PRNG must be generated at high speed to encrypt the big data effectively in a symmetric key cryptosystem and should ensure the randomness of the level to pass through the several statistical tests. CA(Cellular Automata) based PRNGs are known to be easy to implement in hardware and to have better randomness than LFSR based PRNGs. In this paper, we design PRNGs based on PMLCA(Programable Maximum Length CA) that can generate effective key sequences in symmetric key cryptosystem. The proposed PRNGs generate bit streams through nonlinear control method. First, we design a PRNG based on an (m,n)-cell PMLCA ℙ with a single complement vector that produces linear sequences with the long period and analyze the period and the generating polynomial of ℙ. Next, we design an (m,n)-cell PC-MLCA based PRNG with two complement vectors that have the same period as ℙ and generate nonlinear sequences, and analyze the location of outputting the nonlinear sequence.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.6
• /
• pp.1301-1308
• /
• 2018

90/150 CA which are used as key generators of the cipher system have more randomness than LFSRs, but synthesis methods of 90/150 CA are difficult. Therefore, 90/150 CA synthesis methods have been studied by many researchers. In order to synthesize a suitable CA, the analysis of the characteristic polynomial of 90/150 CA should be preceded. In general, the characteristic of polynomial ${\Delta}_n$ of n cell 90/150 CA is obtained by using ${\Delta}_{n-1}$ and ${\Delta}_{n-2}$. Choi et al. analyzed $H_{2^n}(x)$ and $H_{2^n-1}(x)$, where $H_k(x)$ is the characteristic polynomial of k cell 90/150 CA with state transition rule <$10{\cdots}0$>. In this paper, we propose an efficient method to obtain $H_n(x)$ from $H_{n-1}(x)$ and an efficient algorithm to obtain $H_{2^n+i}(x)$ and $H_{2^n-i}(x)$ ($1{\leq}i{\leq}2^{n-1}$) from $H_{2^n}(x)$ by using this method.