Perfect Local Randomness in Pseudo-Random Sequences
暂无分享,去创建一个
[1] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.
[2] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] 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).
[4] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Silvio Micali,et al. Efficient, Perfect Random Number Generators , 1988, CRYPTO.
[6] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[7] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[8] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[9] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[10] Claus-Peter Schnorr,et al. On the Construction of Random Number Generators and Random Function Generators , 1988, EUROCRYPT.
[11] Evangelos Kranakis. Primality and cryptography , 1986, Wiley-Teubner series in computer science.
[12] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[13] James L. Massey,et al. A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.
[14] A. Joffe,et al. On a sequence of almost deterministic pairwise independent random variables , 1971 .
[15] A. Joffe. On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .
[16] H. O. Lancaster. Pairwise Statistical Independence , 1965 .
[17] Lawrence H. Ozarow,et al. Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..
[18] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..
[19] Tom Verhoeff,et al. An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.
[20] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[21] D. Raghavarao. Constructions and Combinatorial Problems in Design of Experiments , 1971 .