Skip to main content

A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2005 (EUROCAST 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3643))

Included in the following conference series:

Abstract

In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register Machine (CBRM), which uses the sensitivity of chaotic behaviour and allows the application of automata- and shift-register theory. It is shown that a CBRM has good properties of randomness, such as large periods and high linear complexity. It can provide high cryptographic security with fast encryption speed, and can be realized effectively by both hardware and software.

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

Access this chapter

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.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)

    Google Scholar 

  2. Pichler, F., Scharinger, J.: Ciphering by Bernoulli-Shifts in Finite Abelian Groups. In: Pilz, G. (ed.) Contributions to General Algebra, pp. 249–256. Hölder-Pichler-Tempsky, Wien (1995)

    Google Scholar 

  3. Scharinger, J.: Experimentelle harmonische Anaylse von Bäcker-dynamischen 2D Systemen und ihre Anwendung in der Kryptographie, PhD thesis, Johannes Kepler Universität Linz (1994)

    Google Scholar 

  4. Scharinger, J., Pichler, F.: “Bernoulli-Chiffren“, Elektrotechnik und Informationstechnik (e&i), 111. Jg, Heft 11, pp. 576–582 (1994)

    Google Scholar 

  5. Feller, W.: An Introduction to Probability Theory and Its Applications, pp. 242–243. John Wiley, New York (1957)

    MATH  Google Scholar 

  6. Sloane, N.J.A.: Encrypting by Random Rotations. In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 71–128. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  7. Gollmann, D.: Kaskadenschaltungen taktgesteuerter Schieberegister als Pseudozufallszahlengeneratoren, PhD thesis, Johannes Kepler Universität Linz, VWGÖ-Verlag, Wien (1986)

    Google Scholar 

  8. Schneier, B.: Applied Cryptography, Protocols, Algorithms and Source Code in C, 2nd edn., pp. 445–446. John Wiley and Sons, Chichester (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jochinger, D., Pichler, F. (2005). A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556985_41

Download citation

  • DOI: https://doi.org/10.1007/11556985_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31829-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics