Abstract
Random and pseudorandom sources have long been of interest in the study of statistical processes. Applications include the simulation of computer networks and communication channels. In these systems, pseudorandom sources (PRS) are preferred over true random sources (TRS) as repeatability (recreatability) of observations is important.
Chapter PDF
References
R. Rivest, A. Shamir, L. Adleman, ‘On digital signatures and public key cryptosystems’, Comm. of ACM, Vol. 21, Feb. 1978, pp.120–126
W. Diffie, M. Hellman, ‘Privacy and authentication: An introduction to cryptography’, Proc. of the IEEE, Vol. 67, March 1979, pp. 397–427.
D. Kahn, ‘Cryptography and the origin of spread spectrum’, IEEE Spectrum, Vol. 21, no. 9, Sept. 1984, pp. 70–80.
IEEE Standard Dictonary on Electrical and Electronic Terms, IEEE Inc., New York, 1984.
G. Hobson, ‘Charge Transfer Devices’, Edward Arnold, London, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agnew, G.B. (1988). Random Sources for Cryptographic Systems. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive