Quantum Computing - Challenges in the field of security


Published on

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.

Published in: Education, Technology
  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Quantum Computing - Challenges in the field of security

  1. 1. Quantum Computing - Challenges in the field of security - Navin “M@dmAx” Pai
  2. 2. About The Moron <ul><li>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 </li></ul>
  3. 3. If U didn’t know this, shoot yourself!! <ul><li>Moore's Law states, the number of transistors on a μ P doubles every 18 months. </li></ul><ul><li>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. </li></ul>
  4. 4. I Qu(b)it!! <ul><li>Quantum Superposition </li></ul><ul><li>Bit can either </li></ul><ul><li>be 1 or 0 </li></ul><ul><li>Qubit can be 1, 0 </li></ul><ul><li>or a superposition </li></ul><ul><li>of both! </li></ul>
  5. 5. Heisenberg’s Feline
  6. 6. The statement <ul><li>Quantum Computers rock at factoring, esp. using Shor’s theorem. </li></ul><ul><li>Infact, as number of bits increases, the factoring operation becomes more and more efficient! </li></ul>
  7. 7. Long Story Shor(t) <ul><li>O((log N ) 3 ) </li></ul><ul><li>A)Pick random number a<N </li></ul><ul><li>B)Use Period finding function to find period of </li></ul><ul><li>C)Check conditions </li></ul><ul><li>D)GCD of (a r/2 +- 1) and N is one of the reqd. factors </li></ul>
  8. 8. The Problem <ul><li>Most current encryption algorithms work under consideration that factoring large numbers is practically impossible </li></ul><ul><li>Eg. RSA Algorithm (used even by banks/e-commerce) </li></ul>
  9. 9. The Proposed Solution <ul><li>McEliece Encryption system (1978) </li></ul><ul><li>2 19 bit Public key </li></ul><ul><li>+ binary Goppa codes </li></ul><ul><li>Impermeable to </li></ul><ul><li>Shor’s algorithm </li></ul>
  10. 10. Erm…… <ul><li>The McEliece Encryption system has already been cracked! </li></ul><ul><li>TU/e took 2 weeks </li></ul><ul><li>and a cluster of </li></ul><ul><li>100 systems to </li></ul><ul><li>achieve this! </li></ul>
  11. 11. The Actual Solution <ul><li>Stop thinking mathematically </li></ul><ul><li>Think Physics!! </li></ul><ul><li>Physicists are the true answer to the next generation cryptography </li></ul><ul><li>One example is the principle of entanglement </li></ul>
  12. 12. Entanglementalism <ul><li>When pairs of particles are generated by the decay of other particles, naturally or through induced collision, these pairs may be termed &quot;entangled&quot;, in that such pairs often necessarily have linked and opposite qualities such as spin or charge. </li></ul>
  13. 13. Back to teh Kitteh!!
  14. 14. Man in The Middle
  15. 15. Quantum Solution <ul><li>Encryption +Authentication =Security </li></ul>Carter-Wegman Method
  16. 16. Why aren’t we freaking out? <ul><li>Quantum computing is still in its nascent stage </li></ul><ul><li>In 2000, a quantum computer generated and used 7 qubits to factorise 15 =5*3 </li></ul><ul><li>Noise Reduction is very difficult! </li></ul><ul><li>The cost is amazingly high! </li></ul>
  17. 17. Disclaimer <ul><li>No kittehs, quantum or otherwise, were harmed in the making of this presentation!! </li></ul>
  18. 18. /*Questions//Comments*/ <ul><li>No Theoretical Physics Plizz!!  </li></ul><ul><li>Contact: lifeofnavin@gmail.com </li></ul><ul><li>Twitter: @NavinPai </li></ul>