Skip to main content
SpringerLink
Log in

Pseudorandom Number Generator – The Self Programmable Cellular Automata

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2773))

  • 1219 Accesses

Abstract

This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
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. Nandi, S., Kar, B.K., Pal Chaudhuri, P.: Theory and applications of cellular automata in cryptography. IEEE Trans. Comput. 43, 1346–1357 (1994)

    Article  MathSciNet  Google Scholar 

  2. Chowdhury, D.R., Gupta, I.S., Pal Chaudhuri, P.: A class of two dimensional cellular automata and applications in random pattern testing. Journal of Electrical Testing: Theory and Applications 5, 65–80 (1994)

    Google Scholar 

  3. Nandi, S., Pal Chaudhuri, P.: Analysis of periodic and intermediate boundary 90/150 cellular automata. IEEE Transactions on Computers 45(1) (January 1999)

    Google Scholar 

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

    Article  Google Scholar 

  5. Sipper, M., Tomassini, M.: Generating parallel random number generators by cellular programming. International Journal Modern Physics 7(2), 181–190 (1996)

    Article  Google Scholar 

  6. Sipper, M., Tomassini, M.: On the generation of high-quality random numbers by two-dimensional cellular automata. International Journal Modern Physics 7(2), 181–190 (1996)

    Article  Google Scholar 

  7. Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Applied Soft Computing 1, 151–160 (2001)

    Article  Google Scholar 

  8. ENT test suite, http://www.fourmilab.ch/random

  9. Marsaglia, Diehard (1998), http://stat.fsu.edu/~geo/diehard.html

  10. Guan, S.-U., Zhang, S.: Incremental Evolution of Cellular Automata for Random Number Generation, accepted by International Journal of Modern Physics

    Google Scholar 

  11. Guan, S.-U., Zhang, S.: Pseudorandom Number Generators Based on Controllable Cellular Automata, submitted to IEEE Transactions

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore, 119260

    Sheng-Uei Guan & Syn Kiat Tan

Authors
  1. Sheng-Uei Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Syn Kiat Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Parks Road, OXI 3QD, United Kingdom

    Vasile Palade

  2. Intelligent Systems and Signal Processing Labs, Moulsecoomb, University of Brighton, BN2 4GJ, Brighton, United Kingdom

    Robert J. Howlett

  3. Knowledge-Based Intelligent Engineering Systems Centre, Mawson Lakes, University of South Australia, 5095, Adelaide, SA, Australia

    Lakhmi Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guan, SU., Tan, S.K. (2003). Pseudorandom Number Generator – The Self Programmable Cellular Automata. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_166

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_166

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation