Conference Proceedings

Random sources for cryptographic systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 304 LNCS 77-81
DOI: 10.1007/3-540-39118-5_8
21Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Agnew, G. B. (1988). Random sources for cryptographic systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 304 LNCS, pp. 77–81). Springer Verlag. https://doi.org/10.1007/3-540-39118-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free