Quantum Computing vs Encryption: A Battle to Watch Out for
Download as PPTX, PDF2 likes676 views
The document discusses the emerging field of quantum computing and its potential to disrupt current encryption methods, particularly asymmetric systems like RSA. While quantum computers are still in development, their ability to process qubits simultaneously could allow them to crack encryption much faster than classical computers. Experts suggest that while some encryption methods may need updating, symmetric encryption remains relatively safe, and cryptographers are actively working on new solutions to address these challenges.
Quantum Computing vs Encryption: A Battle to Watch Out for
- 1. Quantum Computing vs Encryption A Battle to Watch Out For
- 2. Could Quantum Computers Put an End to Today’s Encryption Methods? • However, the prevailing quantum computers are still a long way off the mark. • Some of the prototypes are as large as a room. But so were our today’s computers. We all know how that panned out, right? 2 • The thing about revolutions is that nobody can predict when they’ll come but they do. Quantum computing is going to be one such revolution. • The quantum computers are now almost out of the science phase. It’s the engineering part that needs to be taken care of.
- 3. • Nobody knows how many years it’s going to take for quantum computers to take over. Some say seven, some believe fifteen, and some go as far as twenty-five. • The truth? Nobody knows. It’s like weather forecast, albeit less- accurate. But one day, they’re going to be a reality and we must be prepared to embrace it. 3
- 4. • This takes us to the technology that protects our data and privacy on the internet – Encryption. • Encryption is where the repercussions of quantum computing are going to be heard the most. We’ll get to that in a moment but let’s understand the concept of quantum computing first. 4
- 6. Quantum Computing Let’s start with the first set of slides 6
- 7. Quantum Computing • The binary system is the foundation of today’s computers. They’re called ‘bits’. All the information that today’s classical computers take, process and store is in the strings of 0’s and 1’s. • Every piece of data has a combination of many 0’s and/or 1’s attached to it. 7
- 8. Quantum Computing • Keep in mind that it can only be 0 or 1 at a time, not both. This is exactly where quantum computers differ from classical computers. Quantum computers use Qubits instead of Bits. It means that they run 0 & 1 at the same time. • This is called ‘the principle of superposition’. This duality has its roots in quantum mechanics. 8
- 9. • A quantum computer with n qubits can be in 2n states at a time. A quantum computer with two qubits can be in four states simultaneously, three qubits in eight states and so on. • As a result, highly complex problems that cannot be solved by classical computers can be solved by quantum computers. • With quantum computers by our side, we’ll be able to do accurate weather forecasting, efficient drug discovery, space exploration and thousand other things that are still bound by the boundaries of classical computers. 9
- 10. • Suppose we draw out four cards. • Three of these cards are kings and one is a queen. • Now, these cards are shuffled and put on the ground with their faces down. • Now you have to guess which of these four is a queen. How will you do it? Still confused? Let’s understand this with a small game. 10
- 11. • You’ll pick one randomly and hope that it’s the right one. • The probability here is only 25%. • Now let’s feed this puzzle into a classical computer in form of code. • Let’s assign a 0 to every king and 1 to the queen. 11
- 12. • The computer will apply the same method as you did – trial and error. • It’s researched that a classical computer will need 2.5 attempts on an average to solve this problem. • Had this data been fed into a quantum computer, it could have solved it in a single attempt (whoa!). • This is because it can run more than one values simultaneously. 12
- 13. Bits vs Qubit Lets understand the difference between Bits and Cubits with the image illustrated on the next slide page. 13
- 15. 15 Bits
- 16. • Here the number of possibilities are four only. • What if the number of possible solutions is a million digit long? The classical computers run out of steam for such problems. • It might take them thousands of years to solve. For quantum computers, it’s just a matter of minutes. • Did you know that Google’s quantum computer is believed to be 100 million times faster than your computer? Let that sink in for a moment! 16
- 17. THIS IS HOW ENCRYPTION WILL BE AFFECTED 17
- 18. • What are the prime factors of 21? Pretty easy, right? • Now do the same for a number having thousands of digits. • You’d say it’s impossible. • Well, this is the concept behind the most widely accepted asymmetric encryption system, RSA. 18
- 19. Impact of Quantum Computing 19
- 20. • The RSA cryptosystem depends on this concept of prime-factorization. • In RSA, the public key is obtained by multiplying prime-factors – the private keys. • The public key is so large in length that it’s impossible to crack the private keys attached to it. • There are 2112 possibilities to crack the private key. 20
- 21. • This is a certainly an enormous number – well and truly out of the reach of today’s computers. • That’s the point behind every major encryption methods used today. • They’re designed in such a way that no computer can crack them. • But when it comes to quantum computers, the story is entirely different as they’re fundamentally different from classical computers. 21
- 22. • If we apply a quantum computer to crack the private key from the public key, it might be over before you even know it. • Some say this could be done in 100 seconds. It’s because a quantum computer can try so many combinations simultaneously. • Thereby, posing an inescapable threat on today’s encryption methods. From protecting your passwords to safeguarding your credit card details – such encryption methods are used pretty much everywhere. 22
- 23. WHAT DOES THE FUTURE HOLD? 23
- 24. • First, there’s no need to panic. • Quantum computers might be able to break some of the today’s encryption methods, but not all of them. • Compared to the vastly used asymmetric encryption, symmetric encryption algorithms are somewhat safe from the threat of quantum computing. 24
- 25. • However, they might need a bit of sharpening. Dr. Michele Mosca, deputy director of the Institute for Quantum Computing at the University of Waterloo suggested doubling the length of the symmetric encryption keys to safeguard them. • The ugly truth when it comes to quantum computing is that nobody knows when it becomes a reality. • The cryptographers are fully aware of the danger and are looking to develop new techniques and algorithms. • The research and development take time. How much? Again, nobody knows. Such uncertainty on both sides makes this a fascinating and challenging contest. 25
- 26. Will quantum computers make encryption obsolete? Will quantum encryption become a reality? Can scientists develop an unconquerable encryption system 26
- 27. 27 THANKS! If you have any questions about this document please don’t hesitate to contact us at: https://cheapsslsecurity.com/blog/ https://twitter.com/sslsecurity https://www.facebook.com/CheapSSLSecurities https://plus.google.com/+Cheapsslsecurity