Quantum Computational Number Theory
Song Y. Yan
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 Pells equation, principal ideal, unit group, class group, Gauss sums, prime counting function, Riemanns hypothesis and the BSD conjecture.
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 Pells equation, principal ideal, unit group, class group, Gauss sums, prime counting function, Riemanns hypothesis and the BSD conjecture.
년:
2015
출판사:
Springer
언어:
english
페이지:
259
ISBN 10:
3319258214
ISBN 13:
9783319258218
파일:
PDF, 2.80 MB
IPFS:
,
english, 2015
이 도서의 다운로드는 권리 소유자의 요구에 따라 불가합니다