A Panorama of Post-quantum Cryptography

  • Paulo S. L. M. Barreto
  • Felipe Piazza Biasi
  • Ricardo Dahab
  • Julio César López-Hernández
  • Eduardo M. de Morais
  • Ana D. Salina de Oliveira
  • Geovandro C. C. F. Pereira
  • Jefferson E. Ricardini
Chapter

Abstract

In 1994, Peter Shor published a quantum algorithm capable of factoring large integers and computing discrete logarithms in Abelian groups in polynomial time. Since these computational problems provide the security basis of conventional asymmetric cryptosystems (e.g., RSA, ECC), information encrypted under such schemes today may well become insecure in a future scenario where quantum computers are a technological reality. Fortunately, certain classical cryptosystems based on entirely different intractability assumptions appear to resist Shor’s attack, as well as others similarly based on quantum computing. The security of these schemes, which are dubbed post-quantum cryptosystems, stems from hard problems on lattices, error-correcting codes, multivariate quadratic systems, and hash functions. Here we introduce the essential notions related to each of these schemes and explore the state of the art on practical aspects of their adoption and deployment, like key sizes and cryptogram/signature bandwidth overhead.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Paulo S. L. M. Barreto
    • 1
  • Felipe Piazza Biasi
    • 1
  • Ricardo Dahab
    • 2
  • Julio César López-Hernández
    • 2
  • Eduardo M. de Morais
    • 2
  • Ana D. Salina de Oliveira
    • 2
  • Geovandro C. C. F. Pereira
    • 1
  • Jefferson E. Ricardini
    • 1
  1. 1.Escola PolitécnicaUniversity of Sãao PauloSão Paulo (SP)Brazil
  2. 2.Instituto de ComputaçãoUniversity of CampinasCampinas (SP)Brazil

Personalised recommendations