Spectral Bounds on General Hard Core Predicates
暂无分享,去创建一个
[1] Harry Dym,et al. Fourier series and integrals , 1972 .
[2] Noam Nisan,et al. The computational complexity of universal hashing , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[3] Mats Näslund,et al. All Bits ax+b mod p are Hard (Extended Abstract) , 1996, CRYPTO.
[4] Nathan Linial,et al. Spectral properties of threshold functions , 1994, Comb..
[5] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[6] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[7] M. Näslund. All Bits in ax + b mod p are Hard , 1996, CRYPTO 1996.
[8] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[9] Mats Näslund. Universal Hash Functions & Hard Core Bits , 1995, EUROCRYPT.
[10] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[11] Michael Luby,et al. Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.
[12] Nathan Linial,et al. The Influence of Variables on Boolean Functions (Extended Abstract) , 1988, FOCS 1988.
[13] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[14] Mats Näslund,et al. The Complexity of Computing Hard Core Predicates , 1997, CRYPTO.