• 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 the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.34-41
• /
• 2009

In this paper we propose a new image encryption method which utilizes Complemented MLCA(Complemented Maximum Length Cellular Automata) based on IBCA(Intermediate Boundary CA) and 2D CAT(Cellular Automata Transform). The encryption method is processed in the following order. First, Complemented MLCA is used to create a PN (pseudo noise) sequence, which matches the size of the original image. And, the original image goes through a XOR operation with the created sequence to convert the image into Complemented MLCA image. Then, the gateway value is set to produce a 2D CAT basis function. The produced basis function is multiplied by the encrypted MLCA image that has been converted to process the encipherment. Lastly, the stability analysis and PSNR(Peak Signal to Noise Ratio) verifies that the proposed method holds a high encryption quality status.

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

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.25-30
• /
• 2004

Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.212-216
• /
• 2011

Digital watermarking has gained importance in recent years in copyright protection and multimedia. This paper proposes a secure and novel watermarking system based on complemented Maximum Length Cellular Automata (MLCA) and Two-Dimension Cellular Automata Transform (2D CAT). In this watermarking scheme, the original watermark is first encrypted by complemented MLCA with the private keys, and then the encrypted watermark is embedded into the CAT domain of the cover image, at last use the inverse CAT for the transformed image, the watermarked image is obtained. Experiment results show that this new method is more secure and provides robust performance against watermarking attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.393-396
• /
• 2010

A secure and novel watermarking system based on complemented Maximum Length Cellular Automata (MLCA) and Two-Dimension Cellular Automata Transform (2D CAT) is proposed. In this watermarking scheme, the original watermark which is first encrypted by complemented MLCA with the private keys, and the encrypted watermark is embedded into the CAT domain of the cover image. Experiment results show that this new method is more secure and provides robust performance against watermarking attacks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.13-18
• /
• 2017

With the advancement of internet technology, the importance of data protection is gaining more attention. As a possible data protection solution, we propose a novel video encryption method using complemented maximum-length cellular automata (C-MLCA). The first step for encryption is to use 90/150 CA rule to generate a transition matrix T of a C-MLCA state followed by a 2D C-MLCA basis image. Then, we divide the video into multiple frames. Once, we perform exclusive-OR operation with the split frames and the 2D basis image, the final encrypted video can be obtained. By altering values of pixel, the fundamental information in visualizing image data, the proposed method provides improved security. Moreover, we carry out some computational experiments to further evaluate our method where the results confirm its feasibility.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.1001-1008
• /
• 2019

A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.873-880
• /
• 2020

The proposed encryption algorithm strengthens its security by converting pixel-specific values and changing pixel positions. The state transition matrix created by Wolfram's rule creates a complemented CA sequence with the maximum length. Then, we convert the sequence into a 2D basis image and go through a XOR operation with the original image. The final encrypted image is created by shear stressing and rearranging. The image stability analysis verified that the proposed encryption method has high security.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1469-1475
• /
• 2010

This paper presents a problem of existing encryption methods using pseudo-random numbers based on MLCA or complemented MLCA and proposes a method to resolve this problem. The existing encryption methods have a problem which the edge of original image appear on encrypted image because the image have color similarity of adjacent pixels. In this proposed method, we transform the value and spatial coordinates of all pixels by using pseudo-random numbers based on MLCA. This method can resolve the problem of existing methods and improve the level of encryption by encrypting pixel coordinates and pixel values of original image. The effectiveness of the proposed method is proved by conducting histogram and key space analysis.