In theoretical computer science, a distribution (set of numbers) is considered to be pseudorandom if it is similar enough to other sets. This idea of pseudorandomness is studied and has importance in cryptography.