Pseudo-random generators and structure of complete degrees

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 139-147

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036292644     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. The first order isomorphism theorem
2. Reductions in circuit complexity: An isomorphism theorem and a gap theorem
3. On isomorphism and density of NP and other complete sets
4. How to generate cryptographically strong sequences of pseudo-random bits
5. New directions in cryptography
6. A public-key cryptosystem and a signature scheme based on discrete logarithms
7. Complete problems and strong polynomial reducibilities
8. A hardcore predicate for all one-way functions
9. A pseudorandom generator from any one-way function
10. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma
11. Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
12. The isomorphism conjecture fails relative to a random oracle
13. Derandomizing Arthur-Merlin games using hitting sets
14. Hardness vs. randomness
15. A method for obtaining digital signatures and public-key cryptosystems
16. A survey of one-way functions in complexity theory
17. On p-immunity of nondeterministic complete sets
18. Theory and applications of trapdoor functions