The complexity of computing hard core predicates

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

Volumn 1294, Issue , 1997, Pages 1-15

  Goldmann, Mikael ^a   Näislund, Mats ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

One way function; Pseudo randomness; Small depth circuit

Indexed keywords

CRYPTOGRAPHY;

CONSTANT-DEPTH CIRCUITS; HARD CORES; LOWER BOUNDS; ONE-WAY FUNCTIONS; PSEUDORANDOMNESS; SUPER-POLYNOMIALS;

RECONFIGURABLE HARDWARE;

EID: 84937413823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052224     Document Type: Conference Paper

References (14)

1. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr: RSA andRabin Functions: Certain Parts Are as Hardas the Whole. SIAM J. on Computing 17 (1988), no 2, pp. 194-209.
2. P. Beame: A Switching Lemma Primer. Manuscript, 1994.
3. M. Blum and S. Micali: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. on Computing 13 (1986), no 4, pp. 850-864.
4. M. Furst, J. Saxe, and M. Sipser: Parity, Circuits, and the Polynomial Time Hierarchy. Proc. 22nd Symposium on Foundations of Computer Science, IEEE, 1981, pp. 260-270.
5. O. Goldreich and L. A. Levin: A Hard Core Predicate for all One Way Functions. Proc. 21st Symposium on Theory of Computing, ACM, 1989, pp. 25-32.
6. J. Hästad: Computational Limitations of Small-Depth Circuits. ACM doctoral dissertation award, 1986. MIT Press 1987.
7. J. Hfistad, A. W. Schrift, and A. Shamir: The Discrete Logarithm Mod ulo a Composite HidesO(n) Bits. J. of Computer and System Sciences 47 (1993), pp. 376-403.
8. R. Impagliazzo and M. Naor: Effcient Cryptographic Schemes Provably as Secure as Subset Sum. J. of Cryptology 9 (1996), no 4, pp. 199-216.
9. N. Linial, Y. Mansour, and N. Nisan: Constant Depth Circuits, Fourier Transform, and Learnability. J. of the ACM 40 (1993), no 3, pp. 607-620.
10. Y. Mansour, N. Nisan, and P. Tiwari: The Computational Complexity of Universal Hashing. Theoretical Computer Science 107 (1993), pp. 121-133.
11. M. Näislund: Universal Hash Functions & Hard Core Bits. Proc. Eurocrypt 1995, LNCS 921, Springer Verlag, pp. 356-366.
12. M. Nälund: All Bits in ax + b mod p are Hard. Proc. Crypto 1996, LNCS 1109, Springer Verlag, pp. 114-128.
13. A. C. Yao: Theory and Applications of Trapdoor Functions. Proc. 23rd Symposium on Foundations of Computer Science, IEEE, 1982, pp. 80-91.
14. A. C. Yao: Separating the Polynomial-Time Hierarchy by Oracles. Proc. 26th Symposium on Foundations of Computer Science, IEEE, 1985, pp. 1-10