Skip to main content

Random Number Generators

  • Chapter
  • 1007 Accesses

Part of the Springer Series in Information Sciences book series (SSINF,volume 7)

Keywords

  • Random Number Generator
  • Secret Message
  • Period Length
  • Pseudorandom Sequence
  • Gaussian Variable

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Chapter 27

  1. F. J. MacWilliams, N. J. A. Sloane: The Theory of Error-Correcting Codes (North-Holland, Amsterdam 1978)

    Google Scholar 

  2. G. Hoffmann de Visme: Binary Sequence (The English University Press, London 1971)

    Google Scholar 

  3. S. W. Golomb: Shift Register Sequences (Holden-Day, San Francisco 1967)

    Google Scholar 

  4. D. E. Knuth: The Art of Computer Programming, Vol. 2, Seminumerical Algorithms (Addison-Wesley, Reading, MA 1969)

    Google Scholar 

  5. E. N. Gilbert: Unpublished notes (1953)

    Google Scholar 

  6. T. Herlestan: “On the Complexity of Functions of Linear Shift Register Sequences,” in Proceedings of the International Symposium on Information Theory (IEEE, New York 1982) p. 166

    Google Scholar 

  7. H. J. Baker, F. C. Piper: Communications security, a survey of cryptography. IEE Proc. A129, No. 6, 357–376 (1982)

    Google Scholar 

  8. D. P. Robbins, E. D. Bolker: The bias of three pseudo-random shuffles. Aequationees Math. 22, 268–292 (1981)

    MathSciNet  Google Scholar 

  9. P. Diaconis, M. Shahshahani: Generating a random permutation with random transpositions. Z. Wahrscheinlichkeitstheorie 57, 159–179 (1981)

    MathSciNet  Google Scholar 

  10. N. J. A. Sloane: “Encrypting by Random Rotations,” in [Ref. 27.11]Proc. Workshop, Burg Feuerstein, March 29–April 2, 1982, Lecture Notes in Computer Science, Vol. 149 (Springer, Berlin, Heidelberg, New York 1983) pp. 71–128

    Google Scholar 

  11. T. Beth (ed.): Cryptography, Proc. Workshop, Burg Feuerstein, March 29–April 2, 1982, Lecture Notes in Computer Science, Vol. 149 (Springer, Berlin, Heidelberg, New York 1983)

    Google Scholar 

Download references

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Random Number Generators. In: Number Theory in Science and Communication. Springer Series in Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26598-8_27

Download citation