International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random

Authors:
Thomas Beth
Zong-Duo Dai
Download:
DOI: 10.1007/3-540-46885-4_51 (login may be required)
Search ePrint
Search Google
Conference: EUROCRYPT 1989
BibTeX
@inproceedings{eurocrypt-1989-2012,
  title={On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random},
  booktitle={Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={434},
  pages={533-543},
  doi={10.1007/3-540-46885-4_51},
  author={Thomas Beth and Zong-Duo Dai},
  year=1989
}