國立虎尾科技大學 |

Quantum Computational Number Theory

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Quantum Computational Number Theory/ by Song Y. Yan.
Author:	Yan, Song Y.
Description:	IX, 252 p. 40 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-319-25823-2
ISBN:	9783319258232

Quantum Computational Number Theory
Yan, Song Y.

Quantum Computational Number Theory[electronic resource] /by Song Y. Yan. - 1st ed. 2015. - IX, 252 p. 40 illus. in color.online resource.

Introduction -- Classical and Quantum Computation -- Quantum Computing for Integer Factorization -- Quantum Computing for Discrete Logarithms -- Quantum Computing for Elliptic Curve Discrete Logarithms -- Miscellaneous Quantum Algorithms.

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:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Quantum Computational Number Theory
LDR:02890nam a22004215i 4500 001 965793
003 DE-He213
005 20200705194702.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319258232 $9 978-3-319-25823-2
024 7 $a 10.1007/978-3-319-25823-2 $2 doi
035 $a 978-3-319-25823-2
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Yan, Song Y. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 677061
245 1 0 $a Quantum Computational Number Theory $h [electronic resource] / $c by Song Y. Yan.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a IX, 252 p. 40 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Introduction -- Classical and Quantum Computation -- Quantum Computing for Integer Factorization -- Quantum Computing for Discrete Logarithms -- Quantum Computing for Elliptic Curve Discrete Logarithms -- Miscellaneous Quantum Algorithms.
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 Computers. $3 565115
650 0 $a Computer security. $3 557122
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 0 $a Data encryption (Computer science). $3 1051084
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Cryptology. $3 1211076
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319258218
776 0 8 $i Printed edition: $z 9783319258225
776 0 8 $i Printed edition: $z 9783319798462
856 4 0 $u https://doi.org/10.1007/978-3-319-25823-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)