23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) (1982)
Chicago, IL, USA USA
Nov. 3, 1982 to Nov. 5, 1982
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1982.45
Andrew C. Yao , Computer Science Division, University of California, Berkely, California 94720
The purpose of this paper is to introduce a new information theory and explore its appplications. Using modern computational complexity, we study the notion of information that can be accessed through a feasible computation. In Part 1 of this paper, we lay the foundation of the theory and set up a framework for cryptography and pseudorandom number generation. In Part 2, we study the concept of trapdoor functions and examine applications of such functions in cryptography, pseudorandom number generation, and abstract complexity theory.
Information theory, Cryptography, Computer science, Modems, Computational complexity, Complexity theory, Entropy, Extraterrestrial measurements, Data mining
A. C. Yao, "Theory and application of trapdoor functions," 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)(SFCS), Chicago, IL, USA USA, , pp. 80-91.