Quantum Computing - Challenges in the field of security   - Navin “M@dmAx” Pai
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
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.
I Qu(b)it!! Quantum Superposition Bit can either  be 1 or 0 Qubit can be 1, 0  or a superposition  of both!
Heisenberg’s Feline
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!
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 (a r/2  +- 1) and N is one of the reqd. factors
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)
The Proposed Solution McEliece Encryption system (1978) 2 19  bit Public key  + binary Goppa codes Impermeable to  Shor’s algorithm
Erm…… The McEliece Encryption system has already been cracked!  TU/e took 2 weeks  and a cluster of  100 systems to  achieve this!
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
Entanglementalism 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.
Back to teh Kitteh!!
Man in The Middle
Quantum Solution Encryption +Authentication =Security Carter-Wegman Method
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!
Disclaimer No kittehs, quantum or otherwise, were harmed in the making of this presentation!!
/*Questions//Comments*/ No Theoretical Physics Plizz!!  Contact: lifeofnavin@gmail.com Twitter: @NavinPai

Quantum Computing - Challenges in the field of security

  • 1.
    Quantum Computing -Challenges in the field of security - Navin “M@dmAx” Pai
  • 2.
    About The MoronComp Sc. Student/ Net-Sec Junkie / Blogger/ Photographer / Geek/ Super N00b / Quantum Computing Fanatic/ Web Designer / Space Monkey/ Ninja / Technoholic/ Movie Maniac / Goan/ Internet Moron
  • 3.
    If U didn’tknow 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.
  • 4.
    I Qu(b)it!! QuantumSuperposition Bit can either be 1 or 0 Qubit can be 1, 0 or a superposition of both!
  • 5.
  • 6.
    The statement QuantumComputers rock at factoring, esp. using Shor’s theorem. Infact, as number of bits increases, the factoring operation becomes more and more efficient!
  • 7.
    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 (a r/2 +- 1) and N is one of the reqd. factors
  • 8.
    The Problem Mostcurrent encryption algorithms work under consideration that factoring large numbers is practically impossible Eg. RSA Algorithm (used even by banks/e-commerce)
  • 9.
    The Proposed SolutionMcEliece Encryption system (1978) 2 19 bit Public key + binary Goppa codes Impermeable to Shor’s algorithm
  • 10.
    Erm…… The McElieceEncryption system has already been cracked! TU/e took 2 weeks and a cluster of 100 systems to achieve this!
  • 11.
    The Actual SolutionStop thinking mathematically Think Physics!! Physicists are the true answer to the next generation cryptography One example is the principle of entanglement
  • 12.
    Entanglementalism When pairsof 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.
  • 13.
    Back to tehKitteh!!
  • 14.
    Man in TheMiddle
  • 15.
    Quantum Solution Encryption+Authentication =Security Carter-Wegman Method
  • 16.
    Why aren’t wefreaking 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!
  • 17.
    Disclaimer No kittehs,quantum or otherwise, were harmed in the making of this presentation!!
  • 18.
    /*Questions//Comments*/ No TheoreticalPhysics Plizz!!  Contact: lifeofnavin@gmail.com Twitter: @NavinPai