• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.21-32
• /
• 2000

We study theoretical aspects of one-dimensional cellular automata over GF(q), where q is a power of a prime. Some results about the characteristic polynomials of such cellular automata are given. Intermediate boundary cellular automata are defined and related to the more common null boundary cellular automata.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.93-98
• /
• 2008

In this study, analyzed principle about stream cipher that is formed to Cellular Automata foundation. Cellular Automata can embody complicated and various principle with simple identifying marks that is State, Neighborhood, Transition Rules originally. Cellular Automata is hinting that can handle encipherment smoothly using transition rule. Create binary pad (key stream) by Cellular Automata's transition rule 30 applications in treatise that see therefore, and experimented ability of encryption and decryption because using stream cipher of symmetric key encryption way of password classification.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.1
• /
• pp.29-38
• /
• 2008

This treatise analyzed theoretical principle of Cellular Automata systematically. Specially, Cellular Automata is hinting that can handle function of various form using transition rule. Cellular Automata can embody various and complicated principle with simple identifying marks that is "State", "Neighborhood", "Program Rules". Specially, have eminent cognitive faculty in image processing field. Examined closely that the ability excels flying important Edge Detection in image processing using this Cellular Automata in treatise that see therefore.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.433-443
• /
• 2006

In [1], they build two populations' cellular automata model with predation based on the Penna model. In this paper, uncertain aspects and problems of imprecise and vague data are considered in this model. A fuzzy cellular automata model containing movable wolves and sheep has been built. The results show that the fuzzy cellular automata can simulate the classical CA model and can deal with imprecise and vague data.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.67-73
• /
• 2011

We investigate some conditions for hybrid cellular automata to be group cellular automata.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2001

We investigate the relationship between the 0-tree and other trees in linear nongroup cellular automata. And we show that given a 0-basic path of 0-tree and a nonzero attractor ${\alpha}$ of a multiple attractor linear cellulara automata with two predecessor we construct an ${\alpha}$-tree of that multiple attractor linear cellular automata.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.221-224
• /
• 2008

Anghelescu et al. proposed a block cryptosystem based on 8-cell hybrid additive cellular automata with cycle length 8 using state transition rules 51, 60 (or 102). All states must divided into the same cycles in the diagram of the cellular automata. But there exist cellular automata which don't satisfy this condition in Anghelescu et al.'s cryptosystem. In this paper we analyze hybrid additive cellular automata and propose an improved method.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.610-619
• /
• 2003

This paper presents a concept of cellular automata and a modular exponentiation algorithm and implementation of a basic EIGamal encryption by using cellular automata. Nowadays most of modular exponentiation algorithms are implemented by a linear feedback shift register(LFSR), but its structure has disadvantage which is difficult to implement an operation scheme when the basis is changed frequently The proposed algorithm based on a cellular automata in this paper can overcome this shortcomings, and can be effectively applied to the modular exponentiation algorithm by using the characteristic of the parallelism and flexibility of cellular automata. We also propose a new fast multiplier algorithm using the normal basis representation. A new multiplier algorithm based on normal basis is quite fast than the conventional algorithms using standard basis. This application is also applicable to construct operational structures such as multiplication, exponentiation and inversion algorithm for EIGamal cryptosystem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.152-155
• /
• 2009

In this paper, we propose the image encryption method using complemented MLCA based on 90/150 NBCA(Null Boundary Cellular Automata). The encryption method is processed in the following order. First, complemented MLCA, which is derived from linear LFSR, is used to produce a PN(pseudo noise) sequence, which matches the size of the original image. Then, the created complemented MLCA sequence goes through a XOR operation with the original image to become encrypted. Lastly, an experiment is processed to verify the effectiveness of this method.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.81-84
• /
• 2000

Cellular automata are discrete dynamical systems whose behaviour is completely specified in terms of a local relation. If cellular automata convergence to fixed points, then it can be used to image processing. From the generalized Potts automata point of view, we propose in this paper a cellular automata technique for reducing image noise. To minimize blurring effect, an algorithm based on neighborhood median computation is Preferred. Experimental results are reported.