Quantum Attacks on Public-Key Cryptosystems
By: by Song Y. Yan
Contributors: SpringerLink (Online service)
Publisher: Springer US; Imprint: Springer
Published: 2013
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] /
Number of pages: 207
ISBN-13: 9781441977229
Subjects: Cryptology and Information Theory Data Structures; Algebra; Computer software; Symbolic and Algebraic Manipulation; Data structures (Computer science); Algorithm Analysis and Problem Complexity; Computer Communication Networks; Data Encryption; Data encryption (Computer science); Data processing; Mathematics of Computing; Computer science
Description: 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.
Table of contents: title: Classic and Quantum Computation; title: Quantum Attacks on IFP-Based Cryptosystems; title: Quantum Attacks on DLP-Based Cryptosystems; title: Quantum Attacks on ECDLP-Based Cryptosystems; title: Quantum-Computing Resistant Cryptosystems.