Hard instance generation for SAT

Extended abstract
  • Satoshi Horie
  • Osamu Watanabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1350)


We consider the problem of generating hard instances for the Satisfying Assignment 'TechSearch Problem (in short, SAT). It is not known whether SAT is difficult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best reduction is obtained by using the Fast Fourier Transform [SS71], its constant factor is too big in practice. Here we propose to use the Chinese Remainder Theorem for constructing efficient yet simple reductions from FACT to SAT. (In this extended abstract, most proofs are omitted; see [HW97].)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AIM96]
    Y. Asahiro, K. lwarna, and E. Miyano, Random generation of test instances with controlled attributes, in [Joh96], 377–393.Google Scholar
  2. [Dif92]
    W. Diffie, The first ten years of public-key cryptography, in Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, ed.), IEEE Press (1992), 65–134.Google Scholar
  3. [HW97]
    S. Horie and O. Watanabe, Hard instance generation for SAT, Technical Report TR97-0007, Tokyo Inst. of 'Tech., 1997.Google Scholar
  4. [Joh96]
    D.S. Johnson, ed., Clique, Coloring, and Satisfiability, DIMACS Series in Discrete Math. and Theoret. Comput. Sci., American Mathematical Society, 1996.Google Scholar
  5. [Kob97]
    H. Kobayashi, personal communication.Google Scholar
  6. [Knu81]
    D.E. Knuth, The Art of Computer Programming Vol.II (2nd ed.), Addison-Wesley, 1981.Google Scholar
  7. [LL90]
    A.K. Lenstra, H.W. Lenstra, Jr, Algorithms in number theory, Handbook of Theoretical Computer Science Vol.A (J. Van Leeuwen, ed.), Elsevier (1990), 673–715.Google Scholar
  8. [SS71]
    A. Schönhage and V. Strassen, Schnelle multiplikation grosser zahlen, Computing 7 (1971), 281–292.Google Scholar
  9. [Sch94]
    B. Schneier, Applied Cryptography, John Wiley & Sons, Inc., 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Satoshi Horie
    • 1
  • Osamu Watanabe
    • 1
  1. 1.Department of Computer ScienceTokyo Institute of TechnologyJapan

Personalised recommendations