Skip to main content
SpringerLink
Log in

DeBruijn Cellular Automata: A Dynamic Machine Model Based on deBruijn Graph Approach

  • Conference paper
  • First Online:
Proceedings of the International Conference on Advanced Intelligent Systems and Informatics 2017 (AISI 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 639))

  • 2855 Accesses

Abstract

Cellular Automata (CA) plays a vital role in simulating the dynamic system behaviors in an automated fashion. CA-designers always seek to build new regular CA models for realizing the complex behavior of dynamic systems. This Paper introduces a novel algorithm for converting a deBruijn graph G(k) of order k into a novel design of automata called deBruijn Cellular Automata (BCA). The BCA’s configuration can be in one-dimension, two-dimensions, or three-dimensions. According to the input’s size N of deBruign graph G(k) and the number of cells M in the target BCA-design model, the verification results proved that the time complexity (i.e. efficiency) of the proposed algorithm can be computed as \(T(N,M)= 5M+3N-2\), which \(\in O(N*M) \). The proposed algorithm is the first one can be used for generating CA models from the deBruijn graph. This findings demonstrate that BCA is a promising tool for designing new BCA-based algorithms for solving a variety of problems especially in cryptography area.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bhattacharjee, K., Naskar, N., Roy, S., Das, S.: Types, Dynamics, Non-uniformity and Applications. arXiv preprint arXiv:1607.02291 (2016)

  2. Maniccam, S.S., Bourbakis, N.G.: Lossless image compression and encryption using SCAN. Pattern Recogn. 34(6), 1229–1245 (2001)

    Article  MATH  Google Scholar 

  3. Ping, P., Xu, F., Wang, Z.J.: Image encryption based on non-affine and balanced cellular automata. Sig. Process. 105, 419–429 (2014)

    Article  Google Scholar 

  4. Roy, S., Nandi, S., Dansana, J., Pattnaik, P.K.: Application of cellular automata in symmetric key cryptography. In: 2014 International Conference on Communications and Signal Processing (ICCSP), pp. 572–576. IEEE, April 2014

    Google Scholar 

  5. Jaberi, A., Ayanzadeh, R., Mousavi, A.S.Z.: Two-layer cellular automata based cryptography. Trends Appl. Sci. Res. 7(1), 68 (2012)

    Article  Google Scholar 

  6. Del Rey, A.M., Snchez, G.R., De La Villa Cuenca, A.: A protocol to encrypt digital images using chaotic maps and memory cellular automata. Logic J. IGPL 23(3), 485–494 (2015)

    Article  MathSciNet  Google Scholar 

  7. Bhaumik, J., Chowdhury, D.R.: New architectural design of CA-based codec. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 18(7), 1139–1144 (2010)

    Article  Google Scholar 

  8. Navid, A.H.F., Aghababa, A.B.: Cellular learning automata and its applications. In: Salcido, A. (ed.) Emerging Applications of Cellular Automata (2013)

    Google Scholar 

  9. Fort, H.: Two Cellular Automata Designed for Ecological Problems, Mendota, CA and Barro Colorado Island, CA (2013)

    Google Scholar 

  10. Al-Ahmadi, K., See, L., Heppenstall, A.: Validating spatial patterns of urban growth from a cellular automata model. Emerg. Appl. Cell. Automata, 23–52 (2013)

    Google Scholar 

  11. Bhattacharjee, K., Das, S.: Reversibility of d-state finite cellular automata. arXiv preprint arXiv:1502.01187 (2015)

  12. Biswanath, S., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity (2016)

    Google Scholar 

  13. Mustafa, M., Beigh, M.R.: Design and implementation of quantum cellular automata based novel parity generator and checker circuits with minimum complexity and cell count (2013)

    Google Scholar 

  14. Jonathan, G., Jay, Y.: Ch 4: Debruijn graphs and sequence. In: Hand Book of Graph Theory, pp. 253–256. CRC Press, USA (2004)

    Google Scholar 

  15. Zerbino, D.R., Birney, E.: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18(5), 821–829 (2008)

    Article  Google Scholar 

  16. Fraigniaud, P., Gauron, P.: D2B: a de Bruijn based content-addressable network. Theoret. Comput. Sci. 355(1), 65–79 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dougherty, M., Kimm, H., Ham, H.S.: Implementation of the distributed hash tables on peer-to-peer networks. In: 2008 IEEE Sarnoff Symposium, pp. 1–5. IEEE, April 2008

    Google Scholar 

  18. Chai, Z., Cao, Z., Zhou, Y.: Encryption based on reversible second-order cellular automata. In: International Symposium on Parallel and Distributed Processing and Applications, pp. 350–358. Springer, Heidelberg, November 2005

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Menoufyia University, Shebeen El-Kom, Egypt

    Mohamed Torky

  2. Faculty of Computers and Information Technology, Cairo University, Cairo, Egypt

    Aboul Ella Hassanein

  3. Scientific Research Group in Egypt (SRGE), Cairo, Egypt

    Mohamed Torky & Aboul Ella Hassanein

Authors
  1. Mohamed Torky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aboul Ella Hassanein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Torky .

Editor information

Editors and Affiliations

  1. Faculty of Computers and Information, Information Technology Department, Cairo University, Giza, Egypt

    Aboul Ella Hassanien

  2. Dubai International Academic City, The British University in Dubai, Dubai, United Arab Emirates

    Khaled Shaalan

  3. Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt

    Tarek Gaber

  4. Ain Shams University, Cairo, Egypt

    Mohamed F. Tolba

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Torky, M., Hassanein, A.E. (2018). DeBruijn Cellular Automata: A Dynamic Machine Model Based on deBruijn Graph Approach. In: Hassanien, A., Shaalan, K., Gaber, T., Tolba, M. (eds) Proceedings of the International Conference on Advanced Intelligent Systems and Informatics 2017. AISI 2017. Advances in Intelligent Systems and Computing, vol 639. Springer, Cham. https://doi.org/10.1007/978-3-319-64861-3_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64861-3_57

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64860-6

  • Online ISBN: 978-3-319-64861-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation