Text

Quantum computational number theory

---

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.

---

Availability

Detail Information

Series Title

-

Call Number

512.7 YAN q

Publisher

Cham : Springer International Publishing., 2015

Collation

ix, 252 hlm.: ilus.; 23 cm

Language

English

ISBN/ISSN

9783319798462

Classification

512.7

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Kriptografi
Computer security
Coding Theory
Information Theory
Data Encryption (Computer Science)
Theory of Computation
Cryptology
Komputer, Matematika
Systems and data security

Specific Detail Info

-

Statement of Responsibility

Song Y. Yan

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment