• Title/Summary/Keyword: Group Cellular Automata

Search Result 18, Processing Time 0.024 seconds

Image Encryption Based on One Dimensional Nonlinear Group Cellular Automata (1차원 비선형 그룹 셀룰라 오토마타 기반의 영상 암호)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Tae-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.12
    • /
    • pp.1462-1467
    • /
    • 2015
  • Pixel values of original image can be changed by XORing pixel values of original image and pixel values of the basis image obtained by pseudo random sequences. This is a simple method for image encryption. This method is an effect method for easy hardware implementation and image encryption with high speed. In this paper we propose a method to obtain basis image with pseudo random sequences with large nonlinearity using nonlinear cellular automata and maximum length linear cellular automata. And experimental results showed that the proposed image encryption scheme has large key space and low correlation of adjacent cipher pixel values.

SOME PROPERTIES OF CELLULAR AUTOMATA

  • Kim, Jae-Gyeom
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.21 no.4
    • /
    • pp.447-454
    • /
    • 2008
  • In this short note, we will point out and modify some logical errors in literatures about the theory of cellular automata.

  • PDF

Analysis of Hybrid Additive Cellular Automata (하이브리드 가산 셀룰라 오토마타의 분석)

  • Cho, Sung-Jin;Choi, Un-Sook;Kim, Han-Doo;Hwang, Yoon-Hee;Kim, Jin-Gyoung;Kim, Bong-Soo
    • 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.

  • PDF

Evacuation Analysis for a Passenger Ship Using a Cellular Automata Model with Group Behavior (집단 행동을 나타내는 Cellular Automata 모델을 사용한 여객선 승객 탈출 분석)

  • Cha, Ju-Hwan;Ha, Sol;Lee, Kyu-Yeul
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.149-155
    • /
    • 2011
  • This paper presents simulations of advance evacuation analysis using a cellular automata model for passenger behavior in an emergency of passenger ship. The proposed cellular automata model divides the space in a uniform grid called "cell." Each passenger is located in a cell and moves to another cell according to a set of local rules assumed to be associated with the individual and crowd behaviors of the passengers. To verify the usefulness of the proposed cellular automata model, 11 tests, all of which are specified in International Maritime Organization Maritime Safety Committee/ Circulation 1238 (IMO MSC/Circ. 1238), were implemented, and it was confirmed that all the requirements of these tests had been met.

Construction of Complemented Hybrid Group Cellular Automata with Maximum Equal Lengths (최대 동일 길이를 갖는 여원 HGCA구성)

  • Cho S.J.;Choi U.S.;Hwang Y.H.;Kim J.G.;Pyo Y.S.;Kim H.D.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1565-1572
    • /
    • 2006
  • Recently with the ever increasing growth of data communication, the need for security and privacy has become a necessity. The advent of wireless communication and other handheld devices like Personal Digital Assistants and smart cards have made the implementation of cryptosystems a major issue. The Cellular Automata(CA) can be programmed to implement hardware sharing between the encryption and decryption. In this paper, we give conditions for a linear hybrid cellular automata with 60, 102 or 204 to be a linear hybrid group cellular automata C. And we present the conditions which the complemented hybrid group cellular automata C' with complement vectors derived from C has maximum equal lengths in the state transition diagram of C' Also we analyze the relationship among cycles of C' These results generalize Mukhopadhyay's results.

ON GROUP ORDERS OF SOME CELLULAR AUTOMATA

  • Kim, Jae-Gyeom
    • Korean Journal of Mathematics
    • /
    • v.18 no.4
    • /
    • pp.357-368
    • /
    • 2010
  • In this note, we will characterize group orders of hybrid CA configured with rules 60 and 195 and that configured with rules 102 and 153.

Implementation of Crowd Behavior of Pedestrain based AB and CA mathematical model in Intelligent Game Environment (게임환경에서 AB 와 CA 수학모델을 이용한 보행자들의 집단행동 구현)

  • Kim, Seongdong;Kim, Jonghyun
    • Journal of Korea Game Society
    • /
    • v.19 no.6
    • /
    • pp.5-14
    • /
    • 2019
  • In this paper, we propose a modeling and simulation of group behavioral movement of pedestrians using Agent based and Cellular Automata model in intelligent game environment. The social behaviors of the crowds are complex and important, and based on this, the prototype game-model was implemented to show the crowd interaction on AB and CA in the game environment. Our experiment revealed the promise of group behaviour as a cost-efficient, yet accurate platform for researching crowd behaviour in risk situations with real models.

Secure group communication protocol using a cellular automata (셀룰러 오토마타를 이용한 안전한 그룹 통신 프로토콜)

  • 이준석;박영호;이경현
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.27-31
    • /
    • 2003
  • 본 논문은 그름 멤버들간의 안전한 통신을 위한 그룹키 관리(Group key management)에 대한 새로운 방법을 제안한다. 제안된 방식은 선형 셀룰러 오토마타를 이용해서 생성된 involution 특성을 갖는 기본 암호 프리미티브를 이용하여 비밀 공유키를 생성한다. 제안된 방식은 공모에 대한 위협을 근본적으로 방지할 수 있는 특징을 가지고 있다.

  • PDF