{"id":179,"date":"2025-05-13T07:20:46","date_gmt":"2025-05-13T07:20:46","guid":{"rendered":"https:\/\/hackingwithj.com\/?p=179"},"modified":"2025-05-13T11:23:21","modified_gmt":"2025-05-13T11:23:21","slug":"quantum-safe-cryptography-why-you-should-care","status":"publish","type":"post","link":"https:\/\/hackingwithj.com\/?p=179","title":{"rendered":"Quantum-Safe Cryptography \u2013 Why You Should Care"},"content":{"rendered":"\n<p>In a recent post I talked briefly about cryptography. This time, I want to take a deeper dive into what cryptography really is \u2014 and why quantum computers might break the systems we currently rely on. If that happens, it\u2019s not just a nerdy problem: it could impact the core of cybersecurity \u2014 confidentiality, integrity, and availability (the CIA triad).<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">What Is Quantum Computing?<\/h2>\n\n\n\n<p>Maybe you\u2019ve heard the term <em>quantum computers<\/em> tossed around. In case you haven\u2019t: where traditional computers use bits (0s and 1s), quantum computers use <strong>qubits<\/strong> \u2014 based on quantum particles. These can be in a state of <em>superposition<\/em>, meaning not just 0 or 1, but somewhere in between.<\/p>\n\n\n\n<p>Because of this, quantum computers can perform certain types of calculations way faster than traditional ones. That doesn&#8217;t mean they\u2019re better at everything, but for specific math problems (like factoring large primes), they have a massive advantage.<\/p>\n\n\n\n<p>At the time of writing, quantum computers aren\u2019t yet powerful enough to break modern cryptography. But once we reach what\u2019s called a <strong>Cryptographically Relevant Quantum Computer (CRQC)<\/strong>, that could change fast.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\ud83e\udde9 What Is Quantum-Safe Cryptography?<\/h2>\n\n\n\n<p>Quantum-safe (or post-quantum) cryptography is about designing algorithms that are secure <em>even against quantum attacks<\/em>. To understand that, let\u2019s quickly go over the main types of cryptography we use today:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Symmetric cryptography<\/strong>: Uses the <em>same key<\/em> to encrypt and decrypt data. Also used for signing and verifying. Examples: <strong>AES<\/strong>, <strong>3DES<\/strong>, <strong>ChaCha20<\/strong><\/li>\n\n\n\n<li><strong>Asymmetric cryptography<\/strong>:<strong> <\/strong>Uses a <em>public key<\/em> and a <em>private key<\/em>. Examples: <strong>RSA<\/strong>, <strong>ECDSA<\/strong>, <strong>Diffie-Hellman<\/strong><\/li>\n\n\n\n<li><strong>Hashing:<\/strong> No key involved \u2014 it converts data into a unique hash. Some examples are: <strong>MD5, SHA-256, SHA-512, SHA-1<\/strong> <\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Where Quantum Computing Hits Hard<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Symmetric: <\/strong>Quantum computers using <strong>Grover\u2019s algorithm<\/strong> can reduce brute-force time by half. So a 128-bit key that would take 2^128 guesses now only takes 2^64.\n<ul class=\"wp-block-list\">\n<li><strong>Solution:<\/strong> Start doubleling the key lengths, for isntance a 128-bit key normaly takes 2^128 tries to crack, Grover&#8217;s algorithm halfs this to 2^64.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Asymmetric:<\/strong> More critical. <strong>Shor\u2019s algorithm<\/strong> can break RSA and ECC by factoring large numbers or solving discrete logs \u2014 fast.\n<ul class=\"wp-block-list\">\n<li><strong>Solution: <\/strong>For now the only solution is to implent a new algorithm. This will introduce new type of keys that are safe against the quantumcomputers.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Hashing:<\/strong> Hash functions like SHA-256 are still relatively safe. No major quantum-breaking attack exists for them yet. But it\u2019s good to watch developments here too.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">\ud83d\ude80 What\u2019s Next? New Algorithms<\/h2>\n\n\n\n<p>NIST launched a standardization project for post-quantum cryptography in 2016. In 2022, they announced the first selected algorithms:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>CRYSTALS-Kyber<\/strong> (key exchange)<\/li>\n\n\n\n<li><strong>CRYSTALS-Dilithium<\/strong> (digital signatures)<\/li>\n\n\n\n<li>Others in the pipeline: Falcon, SPHINCS+, BIKE (still under review)<\/li>\n\n\n\n<li><strong>Digital signatures:<\/strong> ML-DSA (FIPS 204), SLH-DSA (FIPS 205), FN-DSA (FIPS, in development)<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">\ud83d\udd04 Cryptoagility: Be ready to switch<\/h2>\n\n\n\n<p>One important concept is <strong>cryptoagility<\/strong> \u2014 the ability of a system to switch cryptographic algorithms easily when needed. Instead of hardcoding a specific algorithm, systems should be designed to allow switching with minimal effort. This is key as quantum-safe algorithms evolve and mature.<\/p>\n\n\n\n<p>Cryptoagility helps protect you from:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>New vulnerabilities discovered later<\/li>\n\n\n\n<li>Deprecation of current standards<\/li>\n\n\n\n<li>Needing to replace everything last-minute<\/li>\n<\/ul>\n\n\n\n<p>Starting now means you avoid a panic later.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Real-World Challenges<\/h2>\n\n\n\n<p>Migrating to post-quantum crypto isn\u2019t just a software update:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Larger key sizes = more bandwidth\/storage<\/li>\n\n\n\n<li>Slower performance in some cases<\/li>\n\n\n\n<li>Hardware upgrades may be needed<\/li>\n\n\n\n<li>Supply chains must update too<\/li>\n\n\n\n<li>\u201cStore now, decrypt later\u201d means past data might be at risk if stolen now \ud83d\udd75\ufe0f<\/li>\n<\/ul>\n\n\n\n<p>A smart move? Start using <strong>hybrid cryptography<\/strong> \u2014 combining traditional and quantum-safe methods to ease the transition.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u270d\ufe0f Final thoughts<\/h2>\n\n\n\n<p>Not everything on this blog needs to be about hacking. A big part of my cybersecurity journey is also about gaining a better understanding of potential future risks. Learning about quantum computers and the threat they might pose helps me understand how critical infrastructure works \u2014 and where its weak points may lie. Even if it takes years, preparing now makes you part of the wave instead of scrambling behind it. Secure the future, not just the present.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In a recent post I talked briefly about cryptography. This time, I want to take a deeper dive into what cryptography really is \u2014 and why quantum computers might break the systems we currently rely on. If that happens, it\u2019s not just a nerdy problem: it could impact the core of cybersecurity \u2014 confidentiality, integrity, [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-container-style":"default","site-container-layout":"default","site-sidebar-layout":"default","disable-article-header":"default","disable-site-header":"default","disable-site-footer":"default","disable-content-area-spacing":"default","footnotes":""},"categories":[20],"tags":[21,22,23],"class_list":["post-179","post","type-post","status-publish","format-standard","hentry","category-cybersecurity","tag-cryptography","tag-nist","tag-quantum-computing"],"_links":{"self":[{"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/posts\/179","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=179"}],"version-history":[{"count":10,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/posts\/179\/revisions"}],"predecessor-version":[{"id":190,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=\/wp\/v2\/posts\/179\/revisions\/190"}],"wp:attachment":[{"href":"https:\/\/hackingwithj.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=179"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=179"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hackingwithj.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=179"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}