Post-Quantum Dev OpsNick Doiron@mapmeld on Twitter and GitHub

In the beginning...

Vacuum tubes

Moore’s LawBetter transistors, better computers!

Until they don’t12 atoms, one crystal, one transistor

Can’t be much smaller

Searching for the next big thing

A tale of two Qubits

1994: Quantum will break codes

Shor’s Algorithm

Quantum Fourier Transform

Prime Factorization

Not P =? NP stuff

Do Quantum Computers exist?

Do Quantum computers exist?

What don’t we know?

2016

2013

Quantum-to-Quantum Encryption

Hashes, Goppa Codes, Multivar Quadratics

Lattices. The cool one is Lattices.

Uses Vector Fields

Good Key Size

Worst-case Hardness

Bonus: Fully Homomorphic Encryption

Let’s talk about SSL/TLS

Server and client agree on a cypher that both understand

All based on RSA / prime factors

Similar to using keys with ½ as many bytes (square root # of options)

Your Secret Weapon: AES-256

AES-256 → AES-128… which is Chrome’s default!

On Firefox, you can remove ciphers (and prefer AES-256)

On Mobile Safari, it’s already first

HowsMySSL.com

The Google thing

Very new experiment by Google

BoringSSL (AES + Ring-Learning-With-Errors based on Lattices)

Sometimes called “A New Hope” based on a research paper

Unresolved questions

Do quantum computers exist?

When will they exist, if ever?

Will these codes last against rigorous testing?

Thanks!!! Plz hire me

Nick Doiron@mapmeld on Twitter and GitHub

“Post-Quantum Cryptography” on AmazonPQCrypto.org