Learn More
Are there interactive protocols for co-NP languages? " Inform. book contains reprints of the articles that were critical in the development of the fastest known factoring algorithm. A rigorous time bound for factoring integers, " J. Amer. Math. Soc. An improved algorithm for computing discrete logarithms over GF(p) and its cryptographic significance, " IEEE(More)
  • 1