Peste 4 milioane de titluri în engleză și alte limbi! Descoperă-ți noua poveste astăzi!

Află starea comenzii

Contactați-ne

Quantum Computational Number Theory

Autor: SONG Y. YAN

Limbă:

Legare: Carte broșată

Editura: Springer International Publishing AG

Disponibilitate: În depozitul extern în cantități mici

Expediem în 11-15 zile

582.96 lei

This book provides a comprehensive introduction to advanced topics in the computational and algorith...

Informații despre carte

Autor

SONG Y. YAN

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2018

Pagini

252

EAN

9783319798462

ISBN

9783319798462

Enbook ID

19308627

Editura

Springer International Publishing AG

Greutate

454

Dimensiuni

155 x 235 x 15

Descriere completă

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.