Skip to main content
SpringerLink
Log in

A 2-Dimensional Cellular Automata Pseudorandom Number Generator with Non-linear Neighborhood Relationship

  • Conference paper
Networked Digital Technologies (NDT 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 293))

Included in the following conference series:

Abstract

Until recently, two-dimensional (2-D) cellular automata (CA) pseudorandom number generator (PRNG) research areas have been done based on von Neumann with linear neighborhood relationship. Although the linear neighborhood relationship has an excellent random quality, its cycle length is less than the linear neighborhood relationship. The cycle length is an important w.r.t. cryptographically secure PRNG because of the property of non-prediction for next sequence.

This paper proposes 2-D CA PRNG based on von Neumann method with non-linear neighborhood relationship. In the proposed scheme, five elements (i.e. self, top, bottom, left and right) and two control elements (i.e. c 1 and c 2) with the combination of Boolean operator AND, XOR, or OR are used. The evolution function chooses one combination of XOR & AND and XOR & OR by two control elements. The number of rules in the proposed scheme is higher than previous schemes. To evaluate between the proposed scheme and previous schemes, the ENT and DIEHARD test suites are used in the experiments. In the experimental result, the randomness quality of the proposed PRNG was slightly less than or much the same previous schemes. However, the proposed scheme can generate various CA rule patterns and the number of rules is higher than previous schemes. The correlation coefficient between global state G (t) and G (t + 1) of the proposed scheme is reduced because of using the non-linear neighborhood relationship.

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. Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1996)

    Google Scholar 

  2. Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications, vol. 1. IEEE Computer Society Press (1997)

    Google Scholar 

  3. ANSI X9.17: “American National Standard-Financial institution key management (wholsale)”. ASX X9 Secretariat-American Bankers Association (1985)

    Google Scholar 

  4. FIPS 186: “Digital Signature Standard (DSS)”. Federal Information Processing Standard Publication 186-3, NIST (2009)

    Google Scholar 

  5. PKCS #1: “Public-Key Cryptography Standards (PKCS) #1, RSA Cryptography Standard”. RSA Lab

    Google Scholar 

  6. Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequence of Pseudorandom Bits. SIAM Journal on Computing 13(4), 850–864 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kaliski Jr., B.S.: A Pseudo-random Bit Generator Based on Elliptic Logarithms. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 84–103. Springer, Heidelberg (1987)

    Google Scholar 

  8. von Neumann, J.: The Theory of Self-Reproducing Automata. In: Burks, A.W. (ed.). Univ. of Illinois Press, Urbana and London (1966)

    Google Scholar 

  9. Wolfram, S.: Statistical Mechanics of Cellular Automata. Rev. Mod. Phys. 55, 601–644 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hortensius, P.D., Mcleod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Transaction Computer-Aided Design 8, 842–859 (1989)

    Article  Google Scholar 

  11. Guan, S.-U., Zhang, S.: An Evolutionary Approach to the Design of Controllable Cellular Automata Structure for Random Number Generation. IEEE Transctions on Evolutionary Computation 7(1), 23–36 (2003)

    Article  Google Scholar 

  12. Guan, S.-U., Tan, S.K.: Pseudorandom Number Generation With Self-Programmable Cellular Automata. IEEE Transctions on Computer-Aided Design of Integrated Circuits and Systems 23(7), 1095–1101 (2004)

    Article  Google Scholar 

  13. Tan, S.K., Guan, S.-U.: Evolving cellular automata to generate nonlinear sequences with desirable properties. Applied Soft Computing 7, 1131–1134 (2007)

    Article  Google Scholar 

  14. Seredynski, F., et al.: Cellular automata computations and secret key cryptography. Parallel Computing 30, 753–766 (2004)

    Article  MathSciNet  Google Scholar 

  15. Tomassini, M., Sipper, M., Perrenoud, M.: On the generation of high quality random numbers by two-dimensional cellular automata. IEEE Transactions on Computers 49(10), 1146–1151 (2000)

    Article  Google Scholar 

  16. Guan, S.-U., Zhang, S., Quieta, M.T.R.: 2-D Variation With Asymmetric Neighborship for Pseudorandom Number Generation. IEEE Transaction on Computers 23, 378–388 (2004)

    Google Scholar 

  17. Quieta, M.T.R., Guan, S.-U.: Optimization of 2-D Lattice Cellular Automata for Pseudorandom Number Generation. International Journal of Modern Physics 16(3), 479–500 (2005)

    Article  MATH  Google Scholar 

  18. Shin, S.-H., Yoo, K.-Y.: Analysis of 2-State, 3-Neighborhood Cellular Automata Rules for Cryptographic Pseudorandom Number Generation. In: Proceedings on 12th IEEE International Conference on Computational Science and Engineering, pp. 399–404 (2009)

    Google Scholar 

  19. Shin, S.-H., Yoo, K.-Y.: An 1-Dimension Cellular Automata Evolution with 2-state and selective 4-neithborhood relationship. In: Proceedings of the IASTED International Conference, Modelling and Simulation (MS 2011), pp. 182–189 (2011)

    Google Scholar 

  20. Marsaglia, G.: DIEHARD Test suite (1998), http://www.stat.fsu.edu/pub/diehard/

  21. Walker, J.: ENT Test suite (1998), http://www.fourmilab.ch/random/

Download references

Author information

Authors and Affiliations

  1. Graduate School of Electrical Engineering and Computer Science, Kyungpook, National University, 80 Daehak-ro, Buk-Gu, Daegu, 702-701, South Korea

    Sang-Ho Shin

  2. Department of Information Security, Kyungpook National University, 80 Daehak-ro, Buk-Gu, Daegu, 702-701, South Korea

    Dae-Soo Kim

  3. School of Computer Science and Engineering, Kyungpook National University, 80 Daehak-ro, Buk-Gu, Daegu, 702-701, South Korea

    Kee-Young Yoo

Authors
  1. Sang-Ho Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dae-Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kee-Young Yoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Engineering, Faculty of Engineering, Lakehead University, 955 Oliver Rd., P7B 5E1, Thunder Bay, Ontario, Canada

    Rachid Benlamri

Rights and permissions

Reprints and permissions

Copyright information

Âİ 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shin, SH., Kim, DS., Yoo, KY. (2012). A 2-Dimensional Cellular Automata Pseudorandom Number Generator with Non-linear Neighborhood Relationship. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30507-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30506-1

  • Online ISBN: 978-3-642-30507-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation