"On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a ..."

Thomas Beth, Zong-Duo Dai (1989)

> Home

Details and statistics

DOI: 10.1007/3-540-46885-4_51

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eurocrypt/BethD89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocrypt/BethD89
Thomas Beth, Zong-Duo Dai:
On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random. EUROCRYPT 1989: 533-543

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.