Super-bits, demi-bits, and NP/qpoly-natural proofs

  • Steven Rudich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1269)


We introduce the super-bit conjecture, which allows the development of a theory generalizing the notion of pseudorandomness so as to fool non-deterministic statistical tests. This new kind of pseudo-randomness rules out the existence of N P/poly-natural properties that can work against P/poly. This is an important extension of the original theory of P/poly-natural proofs [10]. We also introduce the closely related demi-bit conjecture which is more intuitive and is the source of interesting open problems.


Proof System Combinatorial Property Pseudorandom Generator Pseudorandom Function Circuit Family 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850–864, 1984.Google Scholar
  2. 2.
    M. Furst and R. Kannan. Succinct certificates for almost all subset sum problems. Siam Journal on Computing, vol 18, 1989, pp. 550–558.Google Scholar
  3. 3.
    O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, 1986.Google Scholar
  4. 4.
    R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology, 9(4):199–216, 1996.Google Scholar
  5. 5.
    J. Krajicek. Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge University Press, 1995.Google Scholar
  6. 6.
    J. Krajiček. Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic. Submitted to Journal of Symbolic Logic, 1994.Google Scholar
  7. 7.
    Michael Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press (1996).Google Scholar
  8. 8.
    A. Razborov. Unprovability of lower bounds on circuit size in certain fragments of Bounded Arithmetic, (Izvestiya of the RAN), 59(1):201–222, 1995.Google Scholar
  9. 9.
    A. Razborov. On provably disjoint NP-pairs. Technical Report RS-94-36, Basic Research in Computer Science Center, Aarhus, Denmark, 1994.Google Scholar
  10. 10.
    A. Razborov and S. Rudich. Natural Proofs. 26th Annual Symposium on Theory of Computing (1994). To appear in special issue of JCSS.Google Scholar
  11. 11.
    A. Yao. Theory and Applications of Trapdoor Functions. Proc. 23rd IEEE Symp. on Foundations of Computer Science, Chicago, IL (Nov. 1982), 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Steven Rudich
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburgh

Personalised recommendations