Skip to main content
SpringerLink
Log in

Characterization of a Class of Complemented Group Cellular Automata

  • Conference paper
Cellular Automata (ACRI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3305))

Included in the following conference series:

Abstract

The present paper characterizes a specific class of complemented group cellular automata (CA). The CA rule referred to as the fundamental transformation divides the entire state space into smaller spaces of equal lengths. Some interesting properties of this particular Cellular Automata have been analyzed. The relations developed promise the development of agreement theorems which shall be useful in constructing key agreement algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Thatcher, J.: Universality in von Neumann cellular model. Tech. Rep. 03105-30-T, ORA, University of Michigan (1964)

    Google Scholar 

  3. Lee, C.: Synthesis of a cellular universal machine using 29-state model of von Neumann. In: The University of Michigan Engineering Summer Conferences (1964)

    Google Scholar 

  4. Codd, E.F.: Cellular Automata. Academic Press Inc., London (1968)

    Google Scholar 

  5. Hennie, F.C.: Iterative Arrays of Logical Circuits. Academic, New York (1961)

    Google Scholar 

  6. Das, A.K., Chaudhuri, P.P.: Efficient characterization of cellular automata. Proc. IEE (Part E) 137, 81–87 (1964)

    Google Scholar 

  7. Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application, ch. 4, vol. 1, pp. 200–300. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  8. Tsalides, P.: Cellular Automata based Built-In Self-Test Structures for VLSI Systems. Elect. Lett. 26(17), 1350–1352 (1990)

    Article  Google Scholar 

  9. Tsalides, P., York, T.A., Thanailakis, A.: Pseudo-random Number Generators for VLSI Systems based on Linear Cellular Automata. IEE Proc. E. Comput. Digit. Tech. 138(4), 241–249 (1991)

    Article  Google Scholar 

  10. Hortensius, P.D., et al.: Cellular automata based pseudo-random number generators for built-in self-test 8(8), 842–859 (1989)

    Google Scholar 

  11. Roy Chowdhury, D.: Theory and Applications of Additive Cellular Automata for Reliable and Testable VLSI Circuit Design, Ph.D. thesis, I.I.T. Kharagpur, India (1992)

    Google Scholar 

  12. Roy Chowdhury, D., Pal Chaudhuri, P.: Parallel memory testing: a BIST approach. In: Proc. 3rd Intl. Workshop on VLSI Design. Bangalore, India, pp. 373–377 (1989)

    Google Scholar 

  13. Das, A.K.: Additive Cellular Automata: Theory and Application as a Built-in Self-test Structure, Ph.D. thesis, I.I.T. Kharagpur, India (1990)

    Google Scholar 

  14. Knuth, D.E.: The Art of Computer Programming - Seminumerical Algorithms. Addison-Wesley, Reading (1981)

    Google Scholar 

  15. Gantmatcher, F.R.: The Theory of Matrices, vol. 11. Chelsea Publishing Co., NY. (1959)

    Google Scholar 

  16. Golomb, S.W.: Shift Register Sequences. Holden Day (1967)

    Google Scholar 

  17. Elspas, B.: The theory of autonomos linear sequential networks. TRE Trans. on Circuits CT-6(1), 45–60 (1959)

    Google Scholar 

  18. Sen, S., Shaw, C., Roy Chowdhury, D., Ganguly, N., Pal Chaudhuri, P.: Cellular automata based cryptosystem (cac). In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 303–314. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Mukherjee, M., Ganguly, N., Pal Chaudhuri, P.: Cellular automata based authentication (caa). In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 259–269. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Pal Chaudhury, P., Roy Chowdhury, D., Sengupta, I.: Ca-based byte error correcting code. IEEE Transactions on Computers, 371–382 (1995)

    Google Scholar 

  21. Pal Chaudhury, P., Chakraborty, S., Roy Chowdhury, D.: Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines. IEEE Transactions on Computers, 769–781 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology, Kharagpur, India

    Debdeep Mukhopadhyay & Dipanwita Roy Chowdhury

Authors
  1. Debdeep Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dipanwita Roy Chowdhury
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhopadhyay, D., Chowdhury, D.R. (2004). Characterization of a Class of Complemented Group Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation