Login / Signup

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

Thomas BethZong-Duo Dai
Published in: EUROCRYPT (1989)
Keyphrases
  • pseudorandom
  • random number
  • uniformly distributed
  • random numbers
  • secret key
  • space complexity
  • user specific
  • computational complexity
  • uniform distribution
  • worst case
  • cost effective