Affiliation:
1. Massachusetts Institute of Technology, Cambridge
Abstract
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. This generator is a deterministic polynomial-time algorithm that transforms pairs (
g
,
r
), where
g
is
any
one-way function and
r
is a random
k
-bit string, to polynomial-time computable functions ƒ
r
: {1, … , 2
k
} → {1, … , 2
k
}. These ƒ
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference41 articles.
1. ADELMAN L. Time Space and Randomness. Tech. Memo 131 Laboratory for Computer Science MIT Cambridge Mass. 1979. ADELMAN L. Time Space and Randomness. Tech. Memo 131 Laboratory for Computer Science MIT Cambridge Mass. 1979.
2. Relative to a random oracle, A, P^ ~ NP^ ~ co-NP^ with probability I;BENNETT C. H.;SIAM J. Comput. I
3. On the cryptographic security of single RSA bits
4. A fair protocol for signing contracts
Cited by
1193 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献