000 | 03176nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-319-25823-2 | ||
003 | DE-He213 | ||
005 | 20200421111203.0 | ||
007 | cr nn 008mamaa | ||
008 | 151226s2015 gw | s |||| 0|eng d | ||
020 |
_a9783319258232 _9978-3-319-25823-2 |
||
024 | 7 |
_a10.1007/978-3-319-25823-2 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aYan, Song Y. _eauthor. |
|
245 | 1 | 0 |
_aQuantum Computational Number Theory _h[electronic resource] / _cby Song Y. Yan. |
250 | _a1st ed. 2015. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
|
300 |
_aIX, 252 p. 40 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aIntroduction -- 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 | _aThis 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 | _aComputer science. | |
650 | 0 | _aComputer security. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aCoding theory. | |
650 | 0 | _aComputers. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSystems and Data Security. |
650 | 2 | 4 | _aCoding and Information Theory. |
650 | 2 | 4 | _aData Encryption. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319258218 |
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-25823-2 |
912 | _aZDB-2-SCS | ||
942 | _cEBK | ||
999 |
_c53931 _d53931 |