Quantum Computational Number Theory

Song Y. Yan

ISBN 10: 3319798464 / ISBN 13: 9783319798462

Editore: Springer International Publishing, Springer International Publishing, 2018

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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 Theoryis 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.

Codice articolo 9783319798462

Dati bibliografici

• Titolo: Quantum Computational Number Theory
• Editore: Springer International Publishing, Springer International Publishing
• Data di pubblicazione: 2018
• Lingua: Inglese
• ISBN 10: 3319798464
• ISBN 13: 9783319798462
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 15 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 15 millimetri di profondità
• Peso: 406 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.