Quantum Computing - Challenges in the field of security

18
nullcon Goa 2010 http://nullcon.net Quantum Computing -Challenges in the field of security - Navin “M@dmAx” Pai

description

Presented by Navin "M@dmAx" Pai at NullCon 2010, Goa, India on the implications of Quantum computing on the field of security. This was a half hour presentation.

Transcript of Quantum Computing - Challenges in the field of security

Page 1: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Quantum Computing-Challenges in the field of security

- Navin “M@dmAx” Pai

Page 2: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

About The Moron

Comp Sc. Student/ Net-Sec Junkie/ Blogger/ Photographer/ Geek/ Super N00b/ Quantum Computing Fanatic/ Web Designer/ Space Monkey/ Ninja/ Technoholic/ Movie Maniac/ Goan/ Internet Moron

Page 3: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

If U didn’t know this, shoot yourself!!

Moore's Law states, the number of transistors on a μP doubles every 18 months.

So by 2020 or 2030 will find the circuits on a μP measured on an atomic scale. And the logical next step will be quantum computers, which will harness the power of atoms and molecules to perform memory and processing tasks.

Page 4: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

I Qu(b)it!!

Quantum Superposition

Bit can either

be 1 or 0

Qubit can be 1, 0

or a superposition

of both!

Page 5: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Heisenberg’s Feline

Page 6: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

The statement

Quantum Computers rock at factoring, esp. using Shor’s theorem.

Infact, as number of bits increases, the factoring operation becomes more and more efficient!

Page 7: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Long Story Shor(t)

O((log N)3)

A)Pick random number a<N

B)Use Period finding function to find period of

C)Check conditions

D)GCD of (ar/2 +- 1) and N is one of the reqd. factors

Page 8: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

The Problem

Most current encryption algorithms work under consideration that factoring large numbers is practically impossible

Eg. RSA Algorithm (used even by banks/e-commerce)

Page 9: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

The Proposed Solution

McEliece Encryption system (1978)

219 bit Public key

+ binary Goppa codes

Impermeable to

Shor’s algorithm

Page 10: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Erm……

The McEliece Encryption system has already been cracked!

TU/e took 2 weeks

and a cluster of

100 systems to

achieve this!

Page 11: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

The Actual Solution

Stop thinking mathematically

Think Physics!!

Physicists are the true answer to the next generation cryptography

One example is the principle of entanglement

Page 12: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Entanglementalism

When pairs of particles are generated by the decay of other particles, naturally or through induced collision, these pairs may be termed "entangled", in that such pairs often necessarily have linked and opposite qualities such as spin or charge.

Page 13: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Back to teh Kitteh!!

Page 14: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Man in The Middle

Page 15: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Quantum Solution

•Encryption +Authentication =SecurityCarter-Wegman Method

Page 16: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Why aren’t we freaking out?

Quantum computing is still in its nascent stage

In 2000, a quantum computer generated and used 7 qubits to factorise 15 =5*3

Noise Reduction is very difficult!

The cost is amazingly high!

Page 17: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

Disclaimer

No kittehs, quantum or otherwise, were harmed in the making of this

presentation!!

Page 18: Quantum Computing - Challenges in the field of security

nullcon Goa 2010 http://nullcon.net

/*Questions//Comments*/

No Theoretical Physics Plizz!!

Contact: [email protected]

Twitter: @NavinPai