• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1331-1342
• /
• 2009

In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.315-318
• /
• 2005

Recently, the advent of wireless communication and other handhold devices like Personal Digital Assistants and smart cards have made in implementation of cryptosystems a major issue. One important aspect of modern day ciphers is the scope for hardware sharing between the encryption and decryption algorithm. The cellular Automata which have been proposed as an alternative to linear feedback shift registers(LFSRs) can be programmed to perform the operations without using any dedicated hardware. But to generalize and analyze CA is not easy. In this paper, we characterizes uniform/hybird complemented group CA with rules 195/153/51 that divide the entire state space into smaller spaces of maximal equal lengths. This properties can be useful in constructing key agreement algorithm.

• 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}$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1063-1066
• /
• 2005

셀룰라 오토마타(Cellular Automata, 이하 CA)는 LFSR의 대안으로 제안되었으나 일반화와 분석이 어려워 거의 이뤄지지 않고 있다. 본 논문에서는 특별한 전이규칙을 가지는 그룹 CA에서 각각의 여원벡터에 대응하여 유도되는 여원 그룹 CA의 구조를 분석한다. 여기서 분석하는 그룹 여원 CA는 전체 상태가 그룹 CA의 최대 주기나 그것의 2배가 되는 같은 길이의 사이클들로 분리된다. 이러한 성질은 암호학에서 키 공유 프로토콜에 유용한 성질로 사용될 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1047-1054
• /
• 2004

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.239-247
• /
• 2016

In recent years, CA has been applied to image security due to its simple and regular structure, local interaction and random-like behavior. Since the initial state is regenerated after some iterations in the group CA, the receiver is able to decrypt by the same CA. Pries et al. showed that the all lengths of the cycles in the complemented group CA C with rules 195, 153, and 51 are equal to the order of C. Nandi et al. reported the encryption technique using C. These results can be made efficient use in cryptosystem by expanding the Nandi's key space. In this paper, we analyze the order of the complemented group CA derived from 90=150 group CA and show that all the lengths of the cycles in the complemented CA are equal to the order of the complemented CA.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.570-573
• /
• 2001

본 논문에서는 선형 TPMACA C의 0-tree에서 0이 아닌 상태를 여원벡터로 갖는 CA C'를 분석하여 C의 모든 상태가 C'의 어느 곳에 있는지를 밝혔으며 또한 C의 상태전이 그래프에서 한 경로만 알면 나머지 상태론 알 수 있음을 밝혔다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.105-111
• /
• 2005

Though GF(2) CA can only handle data with bit units GF(2p) CA can handle data with units more than bit units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2p). And we propose the constructing method the state-transition diagram of a linear SACA over GF(2p) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.2
• /
• pp.29-40
• /
• 2010

Car simulation by TRANSIMS is able to rapidly analyze the broad area based on CA(Cellular Automata) theory, which is the great advantage compared to other existing programs. As the source code of TRANSIMS is open, it may be modified by incorporating the network and traffic characteristics. This study uses the traffic thematic map built in the Korean National Traffic DB(KTDB) center among input date used for building network data of TRANSIMS. However, because the traffic thematic map is not composed as the type required by TRANSIMS, it was corrected and complemented to build a network, and the traffic volume at arterial roads and the traffic volume at each direction of the intersection was calculated through simulation for the area of Suseong-Gu, Daegu Metro. This was compared to the actual traffic volume. As a result of the simulation, it shows error from 14% to 42% at intersection, and from 3% to 8% at arterial roads. This result is very satisfactory because the entire traffic volume of Daegu Metro was not considered, and the tendency of drivers avoiding path due to construction on certain section, the status of road surface and chronic congestion was not reflected.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.335-338
• /
• 2005

Though GF(2) CA can only handle data with bit units, GF(2$^{p}$) CA can handle data with byte units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2$^{p}$). And we propose the constructing method of the state-transition diagram of a linear SACA over GF(2$^{p}$) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.