The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
ISBN: 0-8186-0591-X
pp: 464-479
O. Goldreich , Massachusetts Institute of Technology
This paper develops a constructive theory of randomness for functions based on computational complexity. We present a deterministic polynomial-time algorithm that transforms pairs (g,r), where g is any one-way (in a very weak sense) function and r is a random k-bit string, to polynomial-time computable functions f/sub r/:{1,..., 2/sup k} /spl I.oarr/ {1, ..., 2/sup k/}. These f/sub r/'s cannot be distinguished from random functions by any probabilistic polynomial time algorithm that asks and receives the value of a function at arguments of its choice. The result has applications in cryptography, random constructions and complexity theory.
S. Goldwasser, S. Micali, O. Goldreich, "How To Construct Randolli Functions", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 464-479, 1984, doi:10.1109/SFCS.1984.715949
88 ms
(Ver 3.3 (11022016))