{"id":147072105,"date":"2023-05-25T16:44:00","date_gmt":"2023-05-25T16:44:00","guid":{"rendered":"https:\/\/danconn.dev\/blog\/2023\/05\/25\/quantum-jumps-in-cryptography-and-computing\/"},"modified":"2024-07-28T11:21:33","modified_gmt":"2024-07-28T11:21:33","slug":"quantum-jumps-in-cryptography-and-computing","status":"publish","type":"post","link":"https:\/\/danconn.dev\/blog\/2023\/05\/25\/quantum-jumps-in-cryptography-and-computing\/","title":{"rendered":"Quantum Jumps In Cryptography and Computing"},"content":{"rendered":"

My final talk while working for Sonatype on quantum computing at Devoxx Greece is up!<\/h2>

Wow! What a wild couple of months it\u2019s been! As previously mentioned, when this talk was performed I was working for Sonatype and now I\u2019m very happy as a Platform Security Engineer at Trustpilot<\/a>! <\/p>

I actually think this was my best talk so far. Which looking back on it makes it bitter sweet. I think the earlier \u201cyaknow-mageddon<\/a>\u201d was finally gone and I delivered it well. Well, as long as we don\u2019t dwell too much on the phrase \u201cvery hugely\u201d being used! People certainly asked me a lot of questions afterwards and it wasn\u2019t quite full, but pretty well attended, as my view while speaking below shows.<\/p>

\"\"\/<\/figure>

For a fair few years I\u2019ve been deeply interested in quantum computing and quantum resistant cryptography. I\u2019m not an expert but I\u2019ve dabbled with IBM\u2019s QISKIT SDK<\/a>. I also researched quantum cryptography as my end of module dissertation, when studying under Professor Bill Buchannan<\/a> at Edinburgh Napier for my Postgrad Certificate in Advanced Security and Digital Forensics. I honestly believe that if it does indeed take off, then the world WILL be very exciting! However it\u2019s no sure bet. For a start we need to resolve P vs NP, <\/a>to assume that we understand class complexity, in particular quantum class complexity correctly! One book on the subject I have come back to time and time again is Quantum Computing Since Democritus by Scott Aaronson. I strongly recommend it as a published version of his lectures on the subject. It allows you to think differently about qubits, delivering a very complex subject, but with humour along the way.Recently I\u2019ve also been following the NIST Quantum Resistant Cryptography Algorithms proceedings too. This is a very interesting space where, should P vs NP, and therefore our understanding of quantum improvements within exponential and polynomial time be true, then we will need to get rid of all of our current cryptography techniques such as RSA and ECC which rely on the exact kind of problems quantum computers can help with (most of us believe anyhow). The NIST research has been putting these efforts to the test so, should this happen, we are in a good place before quantum computers become mainstream. I spend the first 10 minutes explaining about classical complexity, moving to P vs NP, and joke how Donald Knuth might have ruined it all! We then look at randomness and finally a small part at the end actually on quantum computers and cryptography!Sadly 30 minutes wasn\u2019t enough time to deliver all I needed to and we did need to start in the classical world for the later parts to make sense! Anyhow, I loved it and if I thoroughly recommend Devoxx Greece as a conference to go to! It was their first as a Devoxx and I think it\u2019s here to stay for sure! I particularly loved the part at the end when even if it didn\u2019t achieve everything it was meant to, people thought it was \u201cfucking awesome\u201d and as if they\u2019d just taken drugs! I\u2018m proud of that!<\/p>

\n