Andere Kunden interessierten sich auch für
![Quantum Attacks on Public-Key Cryptosystems]( "Quantum Attacks on Public-Key Cryptosystems")
Quantum Attacks on Public-Key Cryptosystems75,99 €![The New Codebreakers]( "The New Codebreakers")
The New Codebreakers37,99 €![CryptoSchool]( "CryptoSchool")
CryptoSchool40,65 €![Cryptography Made Simple]( "Cryptography Made Simple")
Cryptography Made Simple47,99 €![Information Security and Cryptology]( "Information Security and Cryptology")
Information Security and Cryptology37,99 €![Progress in Cryptology -- LATINCRYPT 2015]( "Progress in Cryptology -- LATINCRYPT 2015")
Progress in Cryptology -- LATINCRYPT 201537,99 €![Information Theoretic Security]( "Information Theoretic Security")
Information Theoretic Security37,99 €
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. 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.
"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)