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

• East Asian mathematical journal
• /
• v.31 no.1
• /
• pp.19-25
• /
• 2015

We investigate periodicities of some additive cellular automata with null boundary condition.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.543-551
• /
• 2014

We investigate periodicities of some hybrid cellular automata configured with rule 102 and 60 and null boundary condition.

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

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.287-300
• /
• 2005

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a maximum-length 90/150 Null Boundary Cellular Automata and we give the relationship among minimum offsets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.361-367
• /
• 2011

In this paper, we propose encryption method to using complemented MLCA(Maximum Length Cellular Automata) based on NBCA(Null Boundary CA) and 2D CAT (Two-Dimensional Cellular Automata Transform) for efficient image encryption. The encryption method is processed in the following order. First, a transition matrix T is created using the Wolfram Rule matrix. Then, the transition matrix T is multiplied to the original image that is intended to be encrypted, which transfers the pixel values of the original image. Furthermore, the converted original image goes through a XOR operation with complemented vector F to convert into a complemented MLCA applied image. Then, the gateway value is set and 2D CAT basis function is created. Also, the 2D CAT is encrypted by multiplying the created basis function to the complemented MLCA applied image. Lastly, the stability analysis verifies that proposed method holds a high encryption quality status.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.49-52
• /
• 2004

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a 90/150 maximum-length Null Boundary Cellular Automata.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.277-280
• /
• 2000

q가 소수의 거듭제곱의 형태일 때 GF(q)상에서의 1차원 셀룰라 오토마타의 여러 가지 특성들을 연구한다. 이러한 셀룰라 오토마타의 특성다항식에 관한 몇가지 특성들이 제시한다. Intermediate Boundary CA를 정의하고 Null Boundary CA와의 관계를 살펴본다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1939-1946
• /
• 2011

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et. al introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor CA(Cellular Automata). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is larger than that of Mukhopadhyay et. al [12]. As an application we give an algorithm which generate one-way functions whose security lies on the combinatorial properties of our expander graphs. the one-way function using d-regular graph generated by the 60/102 NBCA is based on the Goldreich's construction [5].