Cryptography in NC/sup 0/

@article{Applebaum2004CryptographyIN,
  title={Cryptography in NC/sup 0/},
  author={Benny Applebaum and Yuval Ishai and Eyal Kushilevitz},
  journal={45th Annual IEEE Symposium on Foundations of Computer Science},
  year={2004},
  pages={166-175}
}
We study the parallel time-complexity of basic cryptographic primitives such as one-way functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the possibility of computing instances of these primitives by NC/sup 0/ circuits, in which each output bit depends on a constant number of input bits. Despite previous efforts in this direction, there has been no significant theoretical evidence supporting this possibility, which was posed as an open question in several previous… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…