PQ Key Exchange based on Elliptic Curve Isogenies I was reading the Wikipedia article on Post Quantum Cryptography and was interested in opinions as to whether the Supersingular Elliptic Curve Isogeny Diffie-Hellman listed there would be a good Post Quantum replacement for Elliptic Curve Diffie-Hellman that is being implemented today?
The Supersingular Elliptic Curve Isogeny Key Exchange that you refer to was first published in 2011 by DeFeo, Jao, and Plut.  It builds on but is quite distinct from earlier work by Rostovetsev and Stolbunov in 2006.  As a Post Quantum/Quantum Safe replacement for Elliptic Curve Diffie-Hellman (ECDH) it has several good properties:


The number of bits that need to be exchanged over the communications channel is roughly the same as a normal Diffie-Hellman key exchange.  Not as small as an ECDH but not nearly as large as in other Post Quantum schemes like McEliece or NTRU.
It uses the very well studied mathematics of elliptic curves rather than the more recently accepted lattice approaches to secure cryptography.  If you look in the literature you will see that lattice cryptography has been prone to insecurity in the past.
It offers forward secrecy, just like Diffie-Hellman and ECDH.  McEliece and NTRU need to add an additional exchange to provide forward secrecy.
It uses elliptic curve arithmetic in a finite field which has been widely implementd.
Most importantly, it has withstood 4 years of academic analysis.  Two notable papers which are relevant to the security of this key exchange are:

Computing Isogenies between Supersingular Elliptic Curves over Fp by Delfs and Galbraith
    http://arxiv.org/pdf/1310.7789v1.pdf

A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves by Biasse, Jao and Sankar
    http://cacr.uwaterloo.ca/techreports/2014/cacr2014-24.pdf


Both papers support the basic security of the Supersingular Isogeny Key exchange though it should be noted that one of the authors (Jao) is also one of the inventors of the key exchange.


There seem to be no patents on the key exchange.


However there is a shortcoming:

Computing Isogenies of Supersingular Elliptic curves and composing these isogenies is computationally harder than other post quantum schemes being considered like McEliece, NTRU, or the Ring-LWE schemes.

In the paper which presented the key exchange, the authors present algorithms which require over 100ms of computation on a 2.5GHz computer for each side of the exchange. Half of that can be done offline but it is worth noting.  There has been further work by Shumow and Shumow and Moody on creating more efficient computational models.  Both the original inventors of the key exchange and Shumow have posted their code online.  It is a good bet that if people became more interested in actually using this key exchange, there could be some significant improvements in computation like Dan Bernstein and Tanja Lange have done for standard Elliptic curve cryptography.  A coding contest for the fastest Elliptic Curve Isogeny computations for 768-bit supersingular curves would be an good way to test the performance limits.

Does that answer your question?