Question: What are some future hopes for quantum computation?

Post-quantum cryptography



Post-quantum cryptography (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against an attack by a quantum computer. As of 2018, this is not true for the most popular public-key algorithms, which can be efficiently broken by a sufficiently strong hypothetical quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems:  the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem. All of these problems can be easily solved on a sufficiently powerful quantum computer running Shor's algorithm.[1][2] Even though current, publicly known, experimental quantum computers lack processing power to break any real cryptographic algorithm,[3] many cryptographers are designing new algorithms to prepare for a time when quantum computing becomes a threat. This work has gained greater attention from academics and industry through the PQCrypto conference series since 2006 and more recently by several workshops on Quantum Safe Cryptography hosted by the European Telecommunications Standards Institute (ETSI) and the Institute for Quantum Computing.[4][5][6]
In contrast to the threat quantum computing poses to current public-key algorithms, most current symmetric cryptographic algorithms and hash functions are considered to be relatively secure against attacks by quantum computers.[2][7] While the quantum Grover's algorithm does speed up attacks against symmetric ciphers, doubling the key size can effectively block these attacks.[8] Thus post-quantum symmetric cryptography does not need to differ significantly from current symmetric cryptography. See section on symmetric-key approach below.
Algorithms
Currently post-quantum cryptography research is mostly focused on six different approaches:[2][5]
Lattice-based cryptography

This approach includes cryptographic systems such as learning with errors, ring learning with errors (ring-LWE),[9][10][11] the ring learning with errors key exchange and the ring learning with errors signature, the older NTRU or GGH encryption schemes, and the newer NTRU signature and BLISS signatures.[12] Some of these schemes like NTRU encryption have been studied for many years without anyone finding a feasible attack. Others like the ring-LWE algorithms have proofs that their security reduces to a worst-case problem.[13] The Post Quantum Cryptography Study Group sponsored by the European Commission suggested that the Stehle–Steinfeld variant of NTRU be studied for standardization rather than the NTRU algorithm.[14][15] At that time, NTRU was still patented.
Multivariate cryptography

This includes cryptographic systems such as the Rainbow (Unbalanced Oil and Vinegar) scheme which is based on the difficulty of solving systems of multivariate equations.  Various attempts to build secure multivariate equation encryption schemes have failed.  However, multivariate signature schemes like Rainbow could provide the basis for a quantum secure digital signature.[16]  There is a patent on the Rainbow Signature Scheme.
Hash-based cryptography

This includes cryptographic systems such as Lamport signatures and the Merkle signature scheme and the newer XMSS[17] and SPHINCS[18] schemes. Hash based digital signatures were invented in the late 1970s by Ralph Merkle and have been studied ever since as an interesting alternative to number-theoretic digital signatures like RSA and DSA.  Their primary drawback is that for any hash-based public key, there is a limit on the number of signatures that can be signed using the corresponding set of private keys.  This fact had reduced interest in these signatures until interest was revived due to the desire for cryptography that was resistant to attack by quantum computers.  There appear to be no patents on the Merkle signature scheme and there exist many non-patented hash functions that could be used with these schemes. The stateful hash-based signature scheme XMSS is described in .[19]
Note that all the above schemes are one-time or bounded-time signatures, Moni Naor and Moti Yung invented UOWHF hashing in 1989 and designed a signature based on hashing (the Naor-Yung scheme)[20]  which can be unlimited-time in use (the first such signature that does not require trapdoor properties).
Code-based cryptography
This includes cryptographic systems which rely on error-correcting codes, such as the McEliece and Niederreiter encryption algorithms and the related Courtois, Finiasz and Sendrier Signature scheme. The original McEliece signature using random Goppa codes has withstood scrutiny for over 30 years.  However, many variants of the McEliece scheme, which seek to introduce more structure into the code used in order to reduce the size of the keys, have been shown to be insecure.[21]  The Post Quantum Cryptography Study Group sponsored by the European Commission has recommended the McEliece public key encryption system as a candidate for long term protection against attacks by quantum computers.[14]
Supersingular elliptic curve isogeny cryptography

This cryptographic system relies on the properties of supersingular elliptic curves and supersingular isogeny graphs to create a Diffie-Hellman replacement with forward secrecy.[22] This cryptographic system uses the well studied mathematics of supersingular elliptic curves to create a Diffie-Hellman like key exchange that can serve as a straightforward quantum computing resistant replacement for the Diffie-Hellman and elliptic curve Diffie–Hellman key exchange methods that are in widespread use today.  Because it works much like existing Diffie–Hellman implementations, it offers forward secrecy which is viewed as important both to prevent mass surveillance by governments but also to protect against the compromise of long term keys through failures.[23]  In 2012, researchers Sun, Tian and Wang of the Chinese State Key Lab for Integrated Service Networks and Xidian University, extended the work of De Feo, Jao, and Plut to create quantum secure digital signatures based on supersingular elliptic curve isogenies.[24]  There are no patents covering this cryptographic system.
Symmetric key quantum resistance
Provided one uses sufficiently large key sizes, the symmetric key cryptographic systems like AES and SNOW 3G are already resistant to attack by a quantum computer.[25] Further, key management systems and protocols that use symmetric key cryptography instead of public key cryptography like Kerberos and the 3GPP Mobile Network Authentication Structure are also inherently secure against attack by a quantum computer.  Given its widespread deployment in the world already, some researchers recommend expanded use of Kerberos-like symmetric key management as an efficient and effective way to get Post Quantum cryptography today.[26]
Security reductions
In cryptography research, it is desirable to prove the equivalence of a cryptographic algorithm and a known hard mathematical problem. These proofs are often called "security reductions", and are used to demonstrate the difficulty of cracking the encryption algorithm. In other words, the security of a given cryptographic algorithm is reduced to the security of a known hard problem.  Researchers are actively looking for security reductions in the prospects for post quantum cryptography.  Current results are given here:
Lattice-based cryptography – Ring-LWE Signature
In some versions of Ring-LWE there is a security reduction to the shortest-vector problem (SVP) in a lattice as a lower bound on the security.  The SVP is known to be NP-hard.[27] Specific ring-LWE systems that have provable security reductions include a variant of Lyubashevsky's ring-LWE signatures defined in a paper by Guneysu, Lyubashevsky, and Poppelmann.[10]  The GLYPH signature scheme is a variant of the Gunesyu, Lyubashevsky, and Poppelmann (GLP) signature which takes into account research results that have come after the publication of the GLP signature in 2012.  Another Ring-LWE signature is Ring-TESLA.[28]
Lattice-based cryptography – NTRU, BLISS
The security of the NTRU encryption scheme and the BLISS[12] signature is believed to be related to, but not provably reducible to, the Closest Vector Problem (CVP) in a Lattice.  The CVP is known to be NP-hard. The Post Quantum Cryptography Study Group sponsored by the European Commission suggested that the Stehle–Steinfeld variant of NTRU which does have a security reduction be studied for long term use instead of the original NTRU algorithm.[14]
Multivariate cryptography – Rainbow
The Rainbow Multivariate Equation Signature Scheme is a member of a class of multivariate quadratic equation cryptosystems called "Unbalanced Oil and Vinegar Cryptosystems" (UOV Cryptosystems)  Bulygin, Petzoldt and Buchmann have shown a reduction of generic multivariate quadratic UOV systems to the NP-Hard Multivariate Quadratic Equation Solving problem.[29]
Hash-based cryptography – Merkle signature scheme
In 2005, Luis Garcia proved that there was a security reduction of Merkle Hash Tree signatures to the security of the underlying hash function. Garcia showed in his paper that if computationally one-way hash functions exist then the Merkle Hash Tree signature is provably secure.[30]
Therefore, if one used a hash function with a provable reduction of security to a known hard problem one would have a provable security reduction of the Merkle tree signature to that known hard problem. [31]
The Post Quantum Cryptography Study Group sponsored by the European Commission has recommended use of Merkle signature scheme for long term security protection against quantum computers.[14]
Code-based cryptography – McEliece
The McEliece Encryption System has a security reduction to the Syndrome Decoding Problem (SDP). The SDP is known to be NP-hard[32]  The Post Quantum Cryptography Study Group sponsored by the European Commission has recommended the use of this cryptography for long term protection against attack by a quantum computer.[14]
Code-based cryptography – RLCE
In 2016, Wang proposed a random linear code encryption scheme RLCE
[33] which is based on McEliece schemes. RLCE scheme can be constructed using any linear code such as Reed-Solomon code by inserting random columns in the underlying linear code generator matrix.
Supersingular elliptic curve isogeny cryptography
Security is related to the problem of constructing an isogeny between two supersingular curves with the same number of points.  The most recent investigation of the difficulty of this problem is by Delfs and Galbraith indicates that this problem is as hard as the inventors of the key exchange suggest that it is.[34]  There is no security reduction to a known NP-hard problem.
Comparison
One common characteristic of many post-quantum cryptography algorithms is that they require larger key sizes than commonly used "pre-quantum" public key algorithms.  There are often tradeoffs to be made in key size, computational efficiency and ciphertext or signature size. The table lists some values for different schemes at a 128 bit post-quantum security level.

A practical consideration on a choice among post-quantum cryptographic algorithms is the effort required to send public keys over the internet. From this point of view, the Ring-LWE, NTRU, and SIDH algorithms provide key sizes conveniently under 1KB, hash-signature public keys come in under 5KB, and MDPC-based McEliece takes about 1KB.  On the other hand, Rainbow schemes require about 125KB and Goppa-based McEliece requires a nearly 1MB key.
Lattice-based cryptography – LWE key exchange and Ring-LWE key exchange
The fundamental idea of using LWE and Ring LWE for key exchange was proposed and filed at the University of Cincinnati in 2011 by Jintai Ding. The basic idea comes from the associativity of matrix multiplications, and the errors are used to provide the security. The paper[44] appeared in 2012 after a provisional patent application was filed in 2012.
In 2014, Peikert[45] presented a key transport scheme following the same basic idea of Ding's, where the new idea of sending additional 1 bit signal for rounding in Ding's construction is also utilized.  For somewhat greater than 128 bits of security, Singh presents a set of parameters which have 6956-bit public keys for the Peikert's scheme.[46]  The corresponding private key would be roughly 14,000 bits.
In 2015, an authenticated key exchange with provable forward security following the same basic idea of Ding's was presented at Eurocrypt 2015,[47] which is an extension of the HMQV[48] construction in Crypto2005. The parameters for different security levels from 80 bits to 350 bits, along with the corresponding key sizes are provided in the paper.[47]
Lattice-based Cryptography – NTRU encryption
For 128 bits of security in NTRU, Hirschhorn, Hoffstein, Howgrave-Graham and Whyte, recommend using a public key represented as a degree 613 polynomial with coefficients 




mod


(

2

10


)





{\displaystyle {\bmod {\left(2^{10}\right)}}}

.  This results in a public key of 6130 bits.  The corresponding private key would be 6743 bits.[35]
Multivariate cryptography – Rainbow signature
For 128 bits of security and the smallest signature size in a Rainbow multivariate quadratic equation signature scheme, Petzoldt, Bulygin and Buchmann, recommend using equations in 





F


31




{\displaystyle \mathbb {F} _{31}}

 with a public key size of just over 991,000 bits, a private key of just over 740,000 bits and digital signatures which are 424 bits in length.[36]
Hash-based cryptography – Merkle signature scheme
In order to get 128 bits of security for hash based signatures to sign 1 million messages using the fractal Merkle tree method of Naor Shenhav and Wool the public and private key sizes are roughly 36,000 bits in length.[49]
Code-based cryptography – McEliece
For 128 bits of security in a McEliece scheme, The European Commissions Post Quantum Cryptography Study group recommends using a binary Goppa code of length at least 



n
=
6960


{\displaystyle n=6960}

 and dimension at least 



k
=
5413


{\displaystyle k=5413}

, and capable of correcting 



t
=
119


{\displaystyle t=119}

 errors.  With these parameters the public key for the McEliece system will be a systematic generator matrix whose non-identity part takes 



k
×
(
n
−
k
)
=
8373911


{\displaystyle k\times (n-k)=8373911}

 bits.  The corresponding private key, which consists of the code support with 



n
=
6960


{\displaystyle n=6960}

 elements from 



G
F
(

2

13


)


{\displaystyle GF(2^{13})}

 and a generator polynomial of with 



t
=
119


{\displaystyle t=119}

 coefficients from 



G
F
(

2

13


)


{\displaystyle GF(2^{13})}

, will be 92,027 bits in length[14]
The group is also investigating the use of Quasi-cyclic MDPC codes of length at least 



n
=

2

16


+
6
=
65542


{\displaystyle n=2^{16}+6=65542}

 and dimension at least 



k
=

2

15


+
3
=
32771


{\displaystyle k=2^{15}+3=32771}

, and capable of correcting 



t
=
264


{\displaystyle t=264}

 errors.  With these parameters the public key for the McEliece system will be the first row of a systematic generator matrix whose non-identity part takes 



k
=
32771


{\displaystyle k=32771}

 bits.  The private key, a quasi-cyclic parity-check matrix with 



d
=
274


{\displaystyle d=274}

 nonzero entries on a column (or twice as much on a row), takes no more than 



d
×
16
=
4384


{\displaystyle d\times 16=4384}

 bits when represented as the coordinates of the nonzero entries on the first row.
Barreto et al. recommend using a binary Goppa code of length at least 



n
=
3307


{\displaystyle n=3307}

 and dimension at least 



k
=
2515


{\displaystyle k=2515}

, and capable of correcting 



t
=
66


{\displaystyle t=66}

 errors.  With these parameters the public key for the McEliece system will be a systematic generator matrix whose non-identity part takes 



k
×
(
n
−
k
)
=
1991880


{\displaystyle k\times (n-k)=1991880}

 bits.[50]  The corresponding private key, which consists of the code support with 



n
=
3307


{\displaystyle n=3307}

 elements from 



G
F
(

2

12


)


{\displaystyle GF(2^{12})}

 and a generator polynomial of with 



t
=
66


{\displaystyle t=66}

 coefficients from 



G
F
(

2

12


)


{\displaystyle GF(2^{12})}

, will be 40,476 bits in length.
Supersingular elliptic curve isogeny cryptography
For 128 bits of security in the supersingular isogeny Diffie-Hellman (SIDH) method, De Feo, Jao and Plut recommend using a supersingular curve modulo a 768-bit prime. If one uses elliptic curve point compression the public key will need to be no more than 8x768 or 6144 bits in length.[51]  A March 2016 paper by authors Azarderakhsh, Jao, Kalach, Koziel, and Leonardi showed how to cut the number of bits transmitted in half, which was further improved by authors Costello, Jao, Longa, Naehrig, Renes and Urbanik resulting in a compressed-key version of the SIDH protocol with public keys only 2640 bits in size.[43] This makes the number of bits transmitted roughly equivalent to the non-quantum secure RSA and Diffie-Hellman at the same classical security level.[52]
Symmetric–key-based cryptography
As a general rule, for 128 bits of security in a symmetric-key-based system, one can safely use key sizes of 256 bits.  The best quantum attack against generic symmetric-key systems is an application of Grover's algorithm, which requires work proportional to the square root of the size of the key space.  To transmit an encrypted key to a device that possesses the symmetric key necessary to decrypt that key requires roughly 256 bits as well.  It is clear that symmetric-key systems offer the smallest key sizes for post-quantum cryptography.
Forward secrecy
A public-key system demonstrates a property referred to as perfect forward secrecy when it generates random public keys per session for the purposes of key agreement. This means that the compromise of one message cannot lead to the compromise of others, and also that there is not a single secret value which can lead to the compromise of multiple messages.  Security experts recommend using cryptographic algorithms that support forward secrecy over those that do not.[53] The reason for this is that forward secrecy can protect against the compromise of long term private keys associated with public/private key pairs.  This is viewed as a means of preventing mass surveillance by intelligence agencies.
Both the Ring-LWE key exchange and supersingular isogeny Diffie-Hellman (SIDH) key exchange can support forward secrecy in one exchange with the other party. Both the Ring-LWE and SIDH can also be used without forward secrecy by creating a variant of the classic ElGamal encryption variant of Diffie-Hellman.
The other algorithms in this article, such as NTRU, do not support forward secrecy as is.
Any authenticated public key encryption system can be used to build a key exchange with forward secrecy.[54]
Open Quantum Safe project
Open Quantum Safe[55][56] (OQS) project was started in late 2016 and has the goal of developing and prototyping quantum-resistant cryptography. It aims to integrate current post-quantum schemes in one library: liboqs.[57] liboqs is an open source C library for quantum-resistant cryptographic algorithms. liboqs initially focuses on key exchange algorithms. liboqs provides a common API suitable for post-quantum key exchange algorithms, and will collect together various implementations. liboqs will also include a test harness and benchmarking routines to compare performance of post-quantum implementations. Furthermore, OQS also provides integration of liboqs into OpenSSL.[58]
As of April 2017, the following key exchange algorithms are supported:[55]

Implementation
One of the main challenges in Post-quantum cryptography is considered to be the implementation of potentially quantum safe algorithms into existing systems. There are tests done, for example by Microsoft Research implementing PICNIC in a PKI using Hardware security modules.[66] Test implementations for Google's NewHope algorithm have also been done by HSM vendors.  
See also
Ideal lattice cryptography (ring-learning with errors is one example of ideal lattice cryptography)
Post-Quantum Cryptography Standardization by NIST
Quantum cryptography, for cryptography based on quantum mechanics; likely to be implemented in quantum computers.


Further reading