Behaviors of Single Attractor Cellular Automata over Galois Field GF(2p)

  • Sung-Jin Cho
  • Un-Sook Choi
  • Yoon-Hee Hwang
  • Han-Doo Kim
  • Hyang-Hee Choi
Conference paper

DOI: 10.1007/11861201_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4173)
Cite this paper as:
Cho SJ., Choi US., Hwang YH., Kim HD., Choi HH. (2006) Behaviors of Single Attractor Cellular Automata over Galois Field GF(2p). In: El Yacoubi S., Chopard B., Bandini S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg

Abstract

In this paper, we analyze behaviors of state transitions of a linear Single Attractor Cellular Automata(SACA) C and the complemented SACA C′ derived from C over Galois Field GF(2p). And we propose the algorithm for the construction of the state transition diagram of C and C′ over GF(2p) by using the new concept of basic path. These results extend the results over GF(2) of Cho et al. for SACA.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sung-Jin Cho
    • 1
  • Un-Sook Choi
    • 2
  • Yoon-Hee Hwang
    • 3
  • Han-Doo Kim
    • 4
  • Hyang-Hee Choi
    • 5
  1. 1.Division of Mathematical SciencesPukyong National UniversityBusanKorea
  2. 2.Department of Multimedia EngineeringTongmyong UniversityBusanKorea
  3. 3.Department of Information SecurityGraduate School, Pukyong National UniversityBusanKorea
  4. 4.Institute of Mathematical Sciences and School of Computer Aided ScienceInje UniversityGimhaeKorea
  5. 5.Department of Applied MathematicsPukyong National UniversityBusanKorea

Personalised recommendations