​​​​​​​Quantum computing is still in its infancy stage, but it poses a threat to the blockchain because of the ability of Quantum computers to factor large prime numbers quickly. Large prime numbers are used in discrete log-based cryptography including those using elliptical curves which is the basis of the cryptography used by Bitcoin.

​​​​​​​Post quantum cryptography is the study of cryptosystems that are secure both on a classical computer and a quantum computer. Lattice cryptography is one of the most actively studied approaches to post quantum cryptography. They are capable of key exchanges, digital signatures and provide a hard problem that is not easy to reverse. In this presentation John Singh will explain how quantum computers work and why they can potentially render current public key cryptography insecure. He will also introduce lattice cryptography and discuss concepts such as the learning with errors problem (LWE), shortest vector problem and how they are applied in lattice cryptography. This presentation does contain Math and reference to theorems that are difficult to understand for those that don’t like the subject.

Presenters