TY  - BOOK
AU  - Yan,Song Y.
ED  - SpringerLink (Online service)
TI  - Quantum Attacks on Public-Key Cryptosystems
SN  - 9781441977229
AV  - QA76.9.D35 
U1  - 005.74 23
PY  - 2013///
CY  - Boston, MA
PB  - Springer US, Imprint: Springer
KW  - Computer science
KW  - Computer communication systems
KW  - Data structures (Computer science)
KW  - Data encryption (Computer science)
KW  - Algorithms
KW  - Mathematics
KW  - Computer Science
KW  - Data Structures, Cryptology and Information Theory
KW  - Data Encryption
KW  - Algorithm Analysis and Problem Complexity
KW  - Mathematics of Computing
KW  - Symbolic and Algebraic Manipulation
KW  - Computer Communication Networks
N1  - Classic and Quantum Computation -- Quantum Attacks on IFP-Based Cryptosystems -- Quantum Attacks on DLP-Based Cryptosystems -- Quantum Attacks on ECDLP-Based Cryptosystems -- Quantum-Computing Resistant Cryptosystems
N2  - The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists. Quantum Attacks on Public-Key Cryptosystems presemts almost all known quantum computing based attacks on public-key cryptosystems, with an emphasis on quantum algorithms for IFP, DLP, and ECDLP. It also discusses some quantum resistant cryptosystems to replace the IFP, DLP and ECDLP based cryptosystems. This book is intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the field
UR  - http://dx.doi.org/10.1007/978-1-4419-7722-9
ER  -