How to Construct Random Functions
Name
MIT-LCS-TM-244.pdf
Size
3.47 MB
Format
Adobe PDF
Checksum (MD5)
2ee892ec1052fd03a0ae8ef1f82428ca
Author(s)
Goldreich, Oded
Goldwasser, Shafi
Micali, Silvio
Date Issued
November 1982
Series/Report no.
MIT-LCS-TM-244
Abstract
We assume that functions that are one-way in a very weak sense exist. We prove that in probabilitic polynomial time it is possible to construct deterministic polynomial time computable functions g:{1,…,2^k} -> {1,…,2^k} that cannot be distinguished by an probabilistic polynomial time algorithm from a random function. Loosely speaking, g provides random access to a K2^k -bit long pad whose entries record the outcome of independent coin flips. This complexity theoretic result has many important applications in Cryptography, Protocols, and Hashing.
Persistent DSpace Link
