On the Universality of the Next Bit Test
暂无分享,去创建一个
[1] J. Boyar. Inferring a Sequence Generated by a Linear Congruence , 1982, FOCS.
[2] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..
[3] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[4] Moni Naor,et al. On Dice and Coins: Models of Computation for Random Generation , 1989, ICALP.
[5] Manuel Blum,et al. Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..
[6] Vijay V. Vazirani,et al. Trapdoor pseudo-random number generators, with applications to protocol design , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[7] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[8] Miklos Santha,et al. Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.
[9] Oded Goldreich,et al. Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[10] Adi Shamir,et al. The discrete log is very discreet , 1990, STOC '90.
[11] Manuel Blum,et al. How to Generate Cryptographically Strong Sequences of Pseudo Random Bits , 1982, FOCS.