img Leseprobe Leseprobe

Quantum Computational Number Theory

Song Y. Yan

PDF
ca. 96,29
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer International Publishing img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Informatik

Beschreibung

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.

Weitere Titel in dieser Kategorie
Cover Inside AI
Akli Adjaoute
Cover Dependable Computing
Zbigniew T. Kalbarczyk

Kundenbewertungen

Schlagwörter

Integer factorization, Quantum computational number theory, Design and analysis of algorithms, Public-key cryptography, Number-theoretic algorithms, Cryptography, Computational complexity theory, Digital signatures, Discrete logarithm, Elliptic curve arithmetic, Quantum computing, Computer algorithms, Computational number theory, Fast computation