• Corpus ID: 239016955

Making Existing Software Quantum Safe: Lessons Learned

  title={Making Existing Software Quantum Safe: Lessons Learned},
  author={Lei Zhang and Andriy V. Miranskyy and Walid Rjaibi and Greg Stager and Michael Gray and John Peck},
In the era of quantum computing, Shor’s algorithm running on quantum computers (QCs) can break asymmetric encryption algorithms that classical computers essentially cannot. QCs, with the help of Grover’s algorithm, can also speed up the breaking of symmetric encryption algorithms. Though the exact date when QCs will become “dangerous” for practical problems is unknown, the consensus is that this future is near. Thus, one needs to start preparing for the era of quantum advantage and ensure… 

Figures and Tables from this paper


Report on Post-Quantum Cryptography
The National Institute of Standards and Technology (NIST)'s current understanding about the status of quantum computing and post-quantum cryptography is shared, and NIST’s initial plan to move forward is outlined.
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
This paper introduces Kyber, a portfolio of post-quantum cryptographic primitives built around a key-encapsulation mechanism (KEM), based on hardness assumptions over module lattices, and introduces a CPA-secure public-key encryption scheme and eventually construct, in a black-box manner, CCA-secure encryption, key exchange, and authenticated-key-exchange schemes.
A Note on Quantum Security for Post-Quantum Cryptography
  • Fang Song
  • Computer Science, Mathematics
  • 2014
Shor’s quantum factoring algorithm and a few other efficient quantum algorithms break many classical crypto-systems. In response, people proposed post-quantum cryptography based on computational
The Impact of Quantum Computing on Present Cryptography
The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
The security of practical quantum key distribution
Quantum key distribution (QKD) is the first quantum information task to reach the level of mature technology, already fit for commercialization. It aims at the creation of a secret key between
On Testing and Debugging Quantum Software
Various use-cases for quantum computers, either standalone or as part of a System of Systems are discussed, and some testing and debugging tactics that one can leverage to ensure the quality of the quantum software are highlighted.
Post-quantum cryptography
The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Benchmarking an 11-qubit quantum computer
The quality of the 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions is characterised by successfully computing two quantum algorithms.
Surface codes: Towards practical large-scale quantum computation
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer,