Quantum Computational Number Theory (Record no. 53931)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03176nam a22005295i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-25823-2 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111203.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 151226s2015 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319258232 |
| -- | 978-3-319-25823-2 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.0151 |
| 100 1# - AUTHOR NAME | |
| Author | Yan, Song Y. |
| 245 10 - TITLE STATEMENT | |
| Title | Quantum Computational Number Theory |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2015. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | IX, 252 p. 40 illus. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-25823-2 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2015. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer security. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data encryption (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding theory. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Systems and Data Security. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Coding and Information Theory. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Data Encryption. |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.