Abstract
Random numbers and random bit strings are essential in many areas of computer science, from sorting, routing in networks, and computer algebra to cryptography. Most computer systems provide a function like rand that delivers elements which look “random” in some sense. However, it is hard to come up with a practical and inexpensive way to generate truly random numbers. One can think of measuring radioactive decay, current machine clock time or disk usage, user input like key stroke timing or mouse movement, but these are either expensive or not very random.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
von zur Gathen, J. (2015). Chapter 11 Random generation. In: CryptoSchool. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48425-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-48425-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48423-4
Online ISBN: 978-3-662-48425-8
eBook Packages: Computer ScienceComputer Science (R0)