Quantum Computational Number Theory
Yan, Song Y.
ISBN 10: 3319258214 ISBN 13: 9783319258218
Editorial: Springer International Publishing AG, 2015
Nuevos
Encuadernación de tapa dura
Librería:
Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 27 de febrero de 2001
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
Num Pages: 247 pages, 29 black & white illustrations, biography. BIC Classification: GPJ; UR; URY. Category: (P) Professional & Vocational. Dimension: 235 x 155. . . 2015. 1st ed. 2015. Hardcover. . . . . N° de ref. del artículo V9783319258218
Sinopsis:
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.
Críticas: “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)
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Quantum Computational Number Theory
Editorial: Springer International Publishing AG
Año de publicación: 2015
Encuadernación: Encuadernación de tapa dura
Condición: New
Edición: 1ª Edición
Los mejores resultados en AbeBooks
Imagen de archivo
Quantum Computational Number Theory (Hardcover)
Publicado por
Springer International Publishing AG, Cham, 2016
ISBN 10: 3319258214
ISBN 13: 9783319258218
Nuevo
Tapa dura
Original o primera edición
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783319258218
Cantidad disponible: 1 disponibles
Imagen de archivo
Quantum Computational Number Theory (Hardcover)
Publicado por
Springer International Publishing AG, Cham, 2016
ISBN 10: 3319258214
ISBN 13: 9783319258218
Nuevo
Tapa dura
Original o primera edición
Librería: AussieBookSeller, Truganina, VIC, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9783319258218
Gastos de envío:
EUR 31,77
De Australia a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles