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

• 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 the Korean Institute of Intelligent Systems
• /
• v.11 no.4
• /
• pp.311-314
• /
• 2001

Recently, research on Intelligent Information Process has actively been under way JD various areas and gradually extended to be adaptive to uncertain and complex dynamic environments. This paper presents a Multiple Valued Logic Automata(MVL-Automata) Model, utilizing properties of difference in a Multiple Valued Logic function. That is, MVL-Automata is able to be autonomously adapted to dynamic changing since an input stling is mapped to the value of a Multiple Valued Logic function and the property of difference in a Multiple Valued Logic function is applied to state transition. Therefore, Multiple Valued Logic Automata can be widely applied to the modeling dynamically of changing environments.

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

• Korean Journal of Mathematics
• /
• v.19 no.3
• /
• pp.291-300
• /
• 2011

In this note, we will investigate some relations among powers of characteristic matrices of uniform cellular automata configured with rule 102 and periodic boundary condition.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.79-88
• /
• 1996

In this paper we define a new short exact sequence of automata and we investigate module-like properties on projective and injective automata

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.4
• /
• pp.759-767
• /
• 2011

In this note, we will characterize powers of characteristic matrices of uniform cellular automata configured with rule 102 and periodic boundary condition.

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

In this paper, we propose a novel blind watermarking Method using 2D CAT (Two dimensional cellular automata transform). In our scheme, firstly, we obtain the gateway values to generate a dual-state, dual-coefficients basis function. Secondly, the basis function transforms images into cellular automata space. Lastly, we use the cellular automata transform coefficients to embed random noise watermark in the cover images. The proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values, better security is guaranteed. Moreover, the new method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.119-124
• /
• 2003

Although there have been many studies on using finite automata for intrusion detection, it has been a difficult problem to generate compact finite automata automatically. In a previous research an approach to profile normal behaviors using finite automata was proposed. They divided the system call sequence of each process into three parts prefix, main portion, and suffix, and then substituted macros for frequently occurring substrings. However, the procedure was not automatic. In this paper we present algorithms to automatically generate intrusion detection automata from the sequence of system calls resulting from the normal runs of the programs. We also show the effectiveness of the proposed method through experiments.