Quantum Attacks on Public-Key Cryptosystems

  • Song Y. Yan

Table of contents

  1. Front Matter
    Pages i-viii
  2. Song Y. Yan
    Pages 1-30
  3. Song Y. Yan
    Pages 189-203
  4. Back Matter
    Pages 205-207

About this book

Introduction

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.

Keywords

Computational Complexity Computational Infeasibility Computational Number Theory Cryptanalysis Cryptography Discrete Logarithms Integer Factorization Lattice Reduction Public-Key Cryptography Quantum Computing

Authors and affiliations

  • Song Y. Yan
    • 1
  1. 1., Department of MathematicsHarvard UniversityCambridgeUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-7722-9
  • Copyright Information Springer Science+Business Media, LLC 2013
  • Publisher Name Springer, Boston, MA
  • eBook Packages Computer Science
  • Print ISBN 978-1-4419-7721-2
  • Online ISBN 978-1-4419-7722-9
  • About this book