Skip to main content
Book cover

Quantum Computational Number Theory

  • Book
  • © 2015

Overview

  • Introduces the basic concepts and results in number theory and quantum computing
  • Discusses three major intractable number-theoretic problems related to the construction of modern public-key cryptography
  • Discusses known quantum algorithms for solving the intractable number-theoretic problems and for attacking the number-theoretic cryptographic schemes

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

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

Keywords

About this book

This book provides a comprehensive introduction to advanced topics in the computational and algorithmic aspects of number theory, focusing on applications in cryptography. Readers will learn to develop fast algorithms, including quantum algorithms, to solve various classic and modern number theoretic problems. Key problems include prime number generation, primality testing, integer factorization, discrete logarithms, elliptic curve arithmetic, conjecture and numerical verification. 

The author discusses quantum algorithms for solving the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP), and the Elliptic Curve Discrete Logarithm Problem (ECDLP) and for attacking IFP, DLP and ECDLP based cryptographic systems. Chapters also cover various other quantum algorithms for Pell's equation, principal ideal, unit group, class group, Gauss sums, prime counting function, Riemann's hypothesis and the BSD conjecture.

Quantum Computational Number Theory is self-contained and intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the related fields. Number theorists, cryptographers and professionals working in quantum computing, cryptography and network security will find this book a valuable asset.

Reviews

“Over the last two decades, the field of quantum computational number theory (QCNT) has grown, and this book summarizes the major developments in the area. … I strongly recommend the book to all young computer science students and to mathematicians who love number theory so they can enjoy this new field.” (Manish Gupta, Computing Reviews, April, 2017)

Authors and Affiliations

  • Wuhan University, Wuhan, China

    Song Y. Yan

Bibliographic Information

  • Book Title: Quantum Computational Number Theory

  • Authors: Song Y. Yan

  • DOI: https://doi.org/10.1007/978-3-319-25823-2

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing Switzerland 2015

  • Hardcover ISBN: 978-3-319-25821-8Published: 06 January 2016

  • Softcover ISBN: 978-3-319-79846-2Published: 30 March 2018

  • eBook ISBN: 978-3-319-25823-2Published: 26 December 2015

  • Edition Number: 1

  • Number of Pages: IX, 252

  • Number of Illustrations: 40 illustrations in colour

  • Topics: Theory of Computation, Systems and Data Security, Coding and Information Theory, Cryptology

Publish with us