Quantum computers are real and are starting to be used for some interesting applications. As well as many applications in finance, organic chemistry and complex dynamical systems there is an ugly elephant in the room. That elephant is Shor's algorithm.
Given a sufficiently powerful quantum computer, Shor's algorithm can factorise numbers in polynomial time. I have implemented it on a quantum simulator and it has been used on real quantum computers. When quantum computers are powerful enough nearly all the encryption techniques that we currently rely on will be useless.
The time is still far off when RSA will be useless but I will share some compelling reasons why we need to be taking action right now to avoid potential catastrophe in the not too distant future.
YOU MAY ALSO LIKE:
Post Quantum Cryptography Apocalypse
James has worked in software since the 1990s, when TDD was something you studied but never did and Agile and Lean were words you used to describe athletes. After working in a startup for 9 years, where he learnt the hard way about Agile, Lean Experiments, Microservices and Pipelines, he started a new life as a consultant in 2005. James is now a principal at Codurance where he tries to encourage positive business transformation through software excellence and a focus on outcome driven cross functional teams.