Abstract
The doctrine in cryptology is that the algorithm of encryption is known to the adversary (Eve) and that the only thing that is kept secret is the key, which normally is a bitsequence or a sequence of natural numbers or elements of a finite ring (e.g. a residue ring or a finite field). Mostly, such key sequences are produced by an algorithmic generator (i.e., they are socalled pseudo-random numbers), since these offer the following benefits: the sequence of numbers can be reproduced for debugging and testing; no special hardware is necessary; a large quantity of random numbers can be produced in a short time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neuenschwander, D. (2004). 4 Physical Random-Number Generators. In: Probabilistic and Statistical Methods in Cryptology. Lecture Notes in Computer Science, vol 3028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25942-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25942-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22001-5
Online ISBN: 978-3-540-25942-8
eBook Packages: Springer Book Archive