Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté : électronique
Titre(s) : Quantum Computational Number Theory [Texte électronique] / by Song Y. Yan
Publication : Cham : Springer International Publishing, 2015
Description matérielle : 1 online resource (IX, 252 p. 40 illus :)
Collection : SpringerLink : Bücher
Note(s) : 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 Theoryis 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
Autre(s) auteur(s) : Yan, Song Y.. Fonction indéterminée
Sujet(s) : Informatique
Ordinateurs
Indice(s) Dewey :
004.015 1 (23e éd.) = Informatique - Principes mathématiques
Identifiants, prix et caractéristiques : ISBN 9783319258232
Identifiant de la notice : ark:/12148/cb44680838m
Notice n° :
FRBNF44680838
(notice reprise d'un réservoir extérieur)
