Quantum Computational Number Theory

Song Y. Yan

ISBN 10: 3319258214 / ISBN 13: 9783319258218

Editore: Springer International Publishing, Springer International Publishing Jan 2016, 2016

Riguardo questo articolo

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch.

Codice articolo 9783319258218

Dati bibliografici

• Titolo: Quantum Computational Number Theory
• Editore: Springer International Publishing, Springer International Publishing Jan 2016
• Data di pubblicazione: 2016
• Lingua: Inglese
• ISBN 10: 3319258214
• ISBN 13: 9783319258218
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 20 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 20 millimetri di profondità
• Peso: 565 grammi

Descrizione articolo

Riassunto

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.

Recensione

“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)