Skip to main content
SpringerLink
Log in

Straight-line complexity and integer factorization

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 877))

Included in the following conference series:

Abstract

We show that if polynomials with many rational roots have polynomial length straight-line complexity, then integer factorization is “easy”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Biggs. Algebraic Graph Theory. Cambridge University Press, 1974.

    Google Scholar 

  2. A. Borodin, private communication, 1994.

    Google Scholar 

  3. A. Borodin and S. Cook. On the Number of Additions to Compute Specific Polynomials. SIAM Journal of Computing, (5):7–15, 1976.

    Google Scholar 

  4. Manuel Blum, Paul Feldman, and Silvio Micali. Non-Interactive Zero-Knowledge and Its Applications. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pages 103–112, 1988.

    Google Scholar 

  5. D. Bressound. Factorization and Primality Testing. Springer-Verlag, 1989.

    Google Scholar 

  6. Joan Feigenbaum and Michael Merritt. Distributed Computing and Cryptography. DIMACS Workshop Series, 1989.

    Google Scholar 

  7. Erich Kaltofen. Computing with Polynomials Given by Straight-Line Programs II Sparse Factorization. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 451–458, 1985.

    Google Scholar 

  8. Erich Kaltofen. Uniform Closure Properties of P-Computable Functions. In Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, pages 330–337, 1986.

    Google Scholar 

  9. Erich Kaltofen. Single-Factor Hensel Lifting and Its Application to the Straight-Line Complexity of Certain Polynomials. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 443–452, 1987.

    Google Scholar 

  10. Serge Lang. Algebra. Addison-Wesley, 1984.

    Google Scholar 

  11. Richard J. Lipton. Polynomials with 0–1 Coefficients that are Hard to Evaluate. SIAM Journal of Computing, 7(1):61–69, 1978.

    Google Scholar 

  12. Richard J. Lipton and Larry J. Stockmeyer. Evaluation of Polynomials with Super Preconditioning. Technical Report, IBM Thomas J. Watson Research Center, 1976.

    Google Scholar 

  13. Jean-Jacques Risler. Some Aspects of Complexity in Real Algebraic Geometry. Journal of Symbolic Computation, 5, 1988.

    Google Scholar 

  14. R.C. Read and W.T. Tutte. Chromatic Polynomials, in Selected Topics in Graph Theory, Academic Press, 1988.

    Google Scholar 

  15. Jean-Paul Van de Wiele. An Optimal Lower Bound on the Number of Total Operations to Compute 0–1 Polynomials Over the Field of Complex Numbers. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 159–165, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Princeton University, 08544, Princeton, NJ

    Richard J. Lipton

Authors
  1. Richard J. Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leonard M. Adleman Ming-Deh Huang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lipton, R.J. (1994). Straight-line complexity and integer factorization. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-58691-1_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58691-3

  • Online ISBN: 978-3-540-49044-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation