大葉大學圖書館 |

Quantum computational number theory[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	006.3843
書名/作者:	Quantum computational number theory/ by Song Y. Yan.
作者:	Yan, Song Y.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	ix, 252 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Quantum computing.
標題:	Number theory.
標題:	Computer Science.
標題:	Theory of Computation.
標題:	Systems and Data Security.
標題:	Coding and Information Theory.
標題:	Data Encryption.
ISBN:	9783319258232
ISBN:	9783319258218
摘要、提要註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-25823-2

Quantum computational number theory[electronic resource] /
Yan, Song Y.

Quantum computational number theory[electronic resource] /by Song Y. Yan. - Cham :Springer International Publishing :2015. - ix, 252 p. :ill., digital ;24 cm.

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.

ISBN: 9783319258232

Standard No.: 10.1007/978-3-319-25823-2doiSubjects--Topical Terms:

636174
Quantum computing.

LC Class. No.: QA76.889

Dewey Class. No.: 006.3843

Quantum computational number theory[electronic resource] /
LDR:02242nam a2200325 a 4500 001 444554
003 DE-He213
005 20160519131743.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319258232 $q (electronic bk.)
020 $a 9783319258218 $q (paper)
024 7 $a 10.1007/978-3-319-25823-2 $2 doi
035 $a 978-3-319-25823-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.889
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 006.3843 $2 23
090 $a QA76.889 $b .Y21 2015
100 1 $a Yan, Song Y. $3 587509
245 1 0 $a Quantum computational number theory $h [electronic resource] / $c by Song Y. Yan.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a ix, 252 p. : $b ill., digital ; $c 24 cm.
520 $a 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.
650 0 $a Quantum computing. $3 636174
650 0 $a Number theory. $3 464118
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Theory of Computation. $3 464054
650 2 4 $a Systems and Data Security. $3 466229
650 2 4 $a Coding and Information Theory. $3 465532
650 2 4 $a Data Encryption. $3 465773
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-25823-2
950 $a Computer Science (Springer-11645)