Pseudorandomness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 687-704

  Goldreich, Oded ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

DETERMINISTIC PROGRAMS; PSEUDO RANDOM; PSEUDORANDOM GENERATORS; PSEUDORANDOM SEQUENCES; PSEUDORANDOMNESS; RANDOM SEEDS; STRETCHING SHORTS; UNIFORM DISTRIBUTION;

RANDOM PROCESSES;

EID: 84974576951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_58     Document Type: Conference Paper

References (37)

1. M. Ajtai, J. Komlos, E. Szemerédi. Deterministic Simulation in LogSpace. In 19th ACM Symposium on the Theory of Computing, pages 132–140, 1987.
2. N. Alon, L. Babai and A. Itai. A fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms, Vol. 7, pages 567–583, 1986.
3. M. Bellare, O. Goldreich, and S. Goldwasser. Randomness in Interactive Proofs. Computational Complexity, Vol. 4, No. 4, pages 319–354, 1993.
4. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, pages 850–864, 1984. Preliminary version in 23rd IEEE Symposium on Foundations of Computer Science, 1982.
5. L. Carter and M. Wegman. Universal Hash Functions. Journal of Computer and System Science, Vol. 18, 1979, pages 143–154.
6. G.J. Chaitin. On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM, Vol. 13, pages 547–570, 1966.
7. B. Chor and O. Goldreich. On the Power of Two–Point Based Sampling. Jour. of Complexity, Vol 5, 1989, pages 96–106. Preliminary version dates 1985.
8. B. Chor and O. Goldreich. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM Journal on Computing, Vol. 17, No. 2, pages 230–261, 1988.
9. T.M. Cover and G.A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., New-York, 1991.
10. O. Goldreich. Foundation of Cryptography – Fragments of a Book. February 1995. Available from http:==theory:lcs:mit:edu=_oded=frag:html.
11. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics series (Vol. 17), Springer, 1998.
12. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. Journal of the ACM, Vol. 33, No. 4, pages 792–807, 1986.
13. O. Goldreich and L.A. Levin. Hard-core Predicates for any One-Way Function. In 21st ACM Symposium on the Theory of Computing, pages 25–32, 1989.
14. O. Goldreich and S. Micali. Increasing the Expansion of Pseudorandom Generators. Unpublished manuscript, 1984.
15. O. Goldreich, and H. Krawczyk. On Sparse Pseudorandom Ensembles. Random Structures and Algorithms, Vol. 3, No. 2, (1992), pages 163–174.
16. O. Goldreich, H. Krawcyzk and M. Luby. On the Existence of Pseudorandom Generators. SIAM Journal on Computing, Vol. 22-6, pages 1163–1175, 1993.
17. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Science, Vol. 28, No. 2, pages 270–299, 1984. Preliminary version in 14th ACM Symposium on the Theory of Computing, 1982.
18. J. Håstad, R. Impagliazzo, L.A. Levin and M. Luby. A Pseudorandom Generator from any One-way Function. SIAM Journal on Computing, Volume 28, Number 4, pages 1364–1396, 1999. Preliminary versions by Impagliazzo et. al. in 21st ACM Symposium on the Theory of Computing (1989) and Håstad in 22nd ACM Symposium on the Theory of Computing (1990).
19. R. Impagliazzo and A. Wigderson. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In 29th ACM Symposium on the Theory of Computing, pages 220–229, 1997.
20. D.E. Knuth. The Art of Computer Programming, Vol. 2 (Seminumerical Algorithms). Addison-Wesley Publishing Company, Inc., 1969 (first edition) and 1981 (second edition).
21. A. Kolmogorov. Three Approaches to the Concept of “The Amount Of Information”. Probl. of Inform. Transm., Vol. 1/1, 1965.
22. L.A. Levin. Randomness Conservation Inequalities: Information and Independence in Mathematical Theories. Inform. and Control, Vol. 61, pages 15–37, 1984.
23. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and its Applications. Springer Verlag, August 1993.
24. J. Naor and M. Naor. Small-bias Probability Spaces: Efficient Constructions and Applications. SIAM J. on Computing, Vol 22, 1993, pages 838–856.
25. N. Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, Vol. 11 (1), pages 63–70, 1991.
26. N. Nisan. Pseudorandom Generators for Space Bounded Computation. Combinatorica, Vol. 12 (4), pages 449–461, 1992.
27. N. Nisan. RL ⊆ SC. Journal of Computational Complexity, Vol. 4, pages 1-11, 1994.
28. N. Nisan and A. Wigderson. Hardness vs Randomness. Journal of Computer and System Science, Vol. 49, No. 2, pages 149–167, 1994.
29. N. Nisan and D. Zuckerman. Randomness is Linear in Space. Journal of Computer and System Science, Vol. 52 (1), pages 43–52, 1996.
30. A.M. Odlyzko. The future of integer factorization. CryptoBytes (The technical newsletter of RSA Laboratories), Vol. 1 (No. 2), pages 5-12, 1995. Available from http://www.research.att.com/_amo
31. A.M. Odlyzko. Discrete logarithms and smooth polynomials. In Finite Fields: Theory, Applications and Algorithms, G. L. Mullen and P. Shiue, eds., Amer. Math. Soc., Contemporary Math. Vol. 168, pages 269–278, 1994. Available from http://www.research.att.com/_amo
32. A.R. Razborov and S. Rudich. Natural proofs. Journal of Computer and System Science, Vol. 55 (1), pages 24–35, 1997.
33. C.E. Shannon. A mathematical theory of communication. Bell Sys. Tech. Jour., Vol. 27, pages 623–656, 1948.
34. R.J. Solomonoff. A Formal Theory of Inductive Inference. Inform. and Control, Vol. 7/1, pages 1–22, 1964.
35. L. Valiant. A theory of the learnable. Communications of the ACM, Vol. 27/11, pages 1134–1142, 1984.
36. L. Trevisan. Constructions of Near-Optimal Extractors Using Pseudo-Random Generators. In 31st ACM Symposium on the Theory of Computing, pages 141–148, 1998.
37. A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.