Universal tests for nonuniform distributions
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[2] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[3] Rafael Hirschfeld,et al. Pseudorandom Generators and Complexity Classes , 1989, Advances in Computational Research.
[4] Manuel Blum,et al. Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..
[5] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Adi Shamir,et al. The discrete log is very discreet , 1990, STOC '90.
[7] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[8] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] Miklos Santha,et al. Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..
[10] 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).
[11] Adi Shamir,et al. On the Universality of the Next Bit Test , 1990, CRYPTO.
[12] Noga Alon,et al. Biased Coins and Randomized Algorithms , 1989, Advances in Computational Research.