Advertisement

On the complexity of composite numbers

  • Toshiya Itoh
  • Kenji Horikawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Keywords

Quadratic Residue Constant Move Real Interaction Interactive Proof Fourth Root 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Adleman, L.M. and Huang, M.D.A., “Recognizing Primes in Random Polynomial Time,” Proc. of STOC, pp.462–469 (1987).Google Scholar
  2. [2]
    Aiello, W. and Håstad, J., “Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds,” JCSS, Vol. 42, No.3, pp. 327–345 (1991).Google Scholar
  3. [3]
    Babai, L. and Moran, S., “Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes,” JCSS, Vol. 36, No.2, pp. 254–276 (1988).Google Scholar
  4. [4]
    Bellare, M., Micali, S., and Ostrovsky, R., “Perfect Zero-Knowledge in Constant Rounds,” Proc. of STOC, pp.482–493 (1990).Google Scholar
  5. [5]
    Fortnow, L., The Complexity of Perfect Zero-Knowledge,” Proc. of STOC, pp.204–209 (1987).Google Scholar
  6. [6]
    Goldreich, O. and Krawczyk, H., “On the Composition of Zero-Knowledge Proof Systems,” Proc. of ICALP'90, LNCS 443, Springer-Verlag, Berlin, pp. 268–282 (1990).Google Scholar
  7. [7]
    Goldwasser, S., Micali, S., and Rackoff, C., “The Knowledge Complexity of Interactive Proof Systems,” SIAM J. Comput., Vol. 18, No.1, pp. 186–208 (1989).CrossRefGoogle Scholar
  8. [8]
    Goldreich, O., Micali, S., and Wigderson, A., “Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems,” JACM, Vol. 38, No.1, pp. 691–729 (1991).CrossRefGoogle Scholar
  9. [9]
    Goldreich, O. and Oren, Y., “Definitions and Properties of Zero-Knowledge Proof Systems,” Tech. Rep. #610, Technion, Department of Computer Science (1990).Google Scholar
  10. [10]
    Rabin, M.O., “Probabilistic Algorithm for Primality Testing,” Journal of Number Theory, Vol. 12, pp. 128–138 (1980).CrossRefGoogle Scholar
  11. [11]
    Solovay, R. and Strassen, V., “A Fast Monte Calro Test for Primality,” SIAM J. Comput., Vol. 6, No.1, pp. 84–85 (1977).CrossRefGoogle Scholar
  12. [12]
    Tompa, M. and Woll, H., “Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,” Proc. of FOCS, pp.472–482 (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Toshiya Itoh
    • 1
  • Kenji Horikawa
    • 1
  1. 1.Department of Information ProcessingInterdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology 4259YokohamaJapan

Personalised recommendations