Tag: pseudorandom-generators

Found 15 results for 'pseudorandom-generators'.

---

1) reference-request - Generating uniform integers in a range from a random generator with another range
2) cc.complexity-theory - On fooling $AC^0$
3) cr.crypto-security - Pseudo-Random Function families whose instances have full domain
4) cr.crypto-security - Are theoretically sound pseudorandom generators used in practice?
5) ds.algorithms - Streaming derandomization
6) cc.complexity-theory - Impagliazzo and Wigderson's famous P=BPP paper
7) cc.complexity-theory - From Extractors to Pseudorandom Generators?
8) randomness - Non-computable=>normal?
9) co.combinatorics - Explicit balanced matrix
10) soft-question - Are linear feedback shift registers being generally discouraged by cryptologists?
11) cr.crypto-security - Parallel pseudorandom number generators
12) cc.complexity-theory - Pseudorandom generators indistinguishable by uniform deterministic adversaries
13) cr.crypto-security - What is the motivation behind the definition of pseudorandom in Nisan/Wigderson?
14) randomness - What is full-entropy bit-strings?
15) ds.algorithms - Efficient (non-crypto-grade?) pseudorandom permutations with arbitrary domain size

---