Skip to main content
SpringerLink
Log in

Quantum Algorithm for Solving Pell’s Equation

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 91 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Buchmann J, Thiel C, Williams HC (1995) Short representation of quadratic integers. In: Bosma W, van der Poorten AJ (eds) Computational algebra and number theory, Sydney 1992. Mathematics and its applications, vol 325. Kluwer Academic, Dordrecht, pp 159–185

    Google Scholar 

  2. Buchmann JA, Williams HC (1989) A key exchange system based on real quadratic fields (extended abstract). In: Brassard G (ed) Advances in cryptology-CRYPTO ’89, 20–24 Aug 1990. Lecture notes in computer science, vol 435. Springer, Berlin, pp 335–343

    Google Scholar 

  3. Cohen H (1993) A course in computational algebraic number theory. Graduate texts in mathematics, vol 138. Springer, Berlin/Heidelberg

    Google Scholar 

  4. Eisentraeger K, Hallgren S, Kitaev A, Song F (2014) A quantum algorithm for computing the unit group of an arbitrary degree number field. In: Proceedings of the 46th ACM symposium on theory of computing

    Google Scholar 

  5. Hallgren S (2007) Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem. J ACM 54(1):1–19

    Article  MathSciNet  MATH  Google Scholar 

  6. Hamdy S, Maurer M (1999) Feige-fiat-shamir identification based on real quadratic fields. Techincal report TI-23/99. Technische Universität Darmstadt, Fachbereich Informatik. http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/TR/

  7. Jozsa R (2003) Notes on Hallgren’s efficient quantum algorithm for solving Pell’s equation. Techincal report, quant-ph/0302134

    Google Scholar 

  8. Lenstra HW Jr (2002) Solving the Pell equation. Not Am Math Soc 49:182–192

    MathSciNet  MATH  Google Scholar 

  9. Thiel C (1995) On the complexity of some problems in algorithmic algebraic number theory. Ph.D. thesis, Universität des Saarlandes, Saarbrücken

    Google Scholar 

  10. Williams HC (2002) Solving the Pell equation. In: Proceedings of the millennial conference on number theory, pp 397–435

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, State College, PA, USA

    Sean Hallgren

Authors
  1. Sean Hallgren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sean Hallgren .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Hallgren, S. (2016). Quantum Algorithm for Solving Pell’s Equation. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_312

Download citation

Publish with us

Policies and ethics

Search

Navigation