1import{j as e,S as s,c as a,L as t,a as r}from"./index-TadJ6696.js";import{B as l}from"./binary-D0XfIZA1.js";import{C as i}from"./cpu-B2TIY3-Z.js";function d(){return e.jsxs("article",{className:"max-w-4xl mx-auto px-4 sm:px-6 py-16 text-white",children:[e.jsx("header",{className:"mb-16",children:e.jsxs("div",{className:"space-y-6 text-center",children:[e.jsxs("div",{className:"inline-flex items-center px-3 py-1 rounded-full bg-blue-500/10 border border-blue-500/20",children:[e.jsx(s,{className:"w-4 h-4 mr-2 text-blue-400"}),e.jsx("span",{className:"text-sm font-medium text-blue-400",children:"Security"})]}),e.jsx("h1",{className:"text-4xl sm:text-5xl font-bold leading-tight bg-clip-text text-transparent bg-gradient-to-r from-white to-gray-400",children:"The Quantum Algorithms Threatening Cybersecurity (and How to Prepare)"}),e.jsxs("div",{className:"flex flex-wrap items-center justify-center gap-4 text-sm text-gray-400",children:[e.jsx("span",{children:"April 12, 2025"}),e.jsx("span",{children:"·"}),e.jsx("span",{children:"3 min read"}),e.jsx("span",{children:"·"}),e.jsx("span",{children:"By Dr. Elena Rodriguez"})]})]})}),e.jsxs("div",{className:"prose prose-invert prose-lg max-w-none",children:[e.jsxs("div",{className:"mb-12",children:[e.jsx("p",{className:"text-xl text-gray-300 leading-relaxed",children:`"What is secure today will be decrypted tomorrow." For decades, we've relied on algorithms like RSA, ECC, and AES to protect our digital infrastructure. However, quantum computing promises to break these foundations with mathematical tools more powerful than ever before.`}),e.jsx("p",{className:"text-xl text-gray-300 leading-relaxed mt-4",children:'The danger is no longer theoretical: many organizations are storing encrypted data today, waiting to decrypt it when they have access to quantum hardware. This strategy is known as "Harvest Now, Decrypt Later."'})]}),e.jsxs("section",{className:"mb-12",children:[e.jsx("h2",{className:"text-2xl font-bold mb-6 text-emerald-400",children:"Shor's Algorithm and the End of RSA"}),e.jsxs("div",{className:"bg-white/5 rounded-xl p-6 mb-6",children:[e.jsx("p",{className:"text-gray-300 mb-4",children:"Peter Shor developed a quantum algorithm that can factorize large prime numbers in polynomial time. This means:"}),e.jsxs("ul",{className:"space-y-3",children:[e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(a,{className:"w-5 h-5 text-rose-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"RSA, DSA, and ECC are no longer secure in a quantum world"})]}),e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(l,{className:"w-5 h-5 text-rose-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"A 2048-bit RSA key can be broken in minutes by a sufficiently large quantum computer"})]}),e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(s,{className:"w-5 h-5 text-rose-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"All X.509 certificate-based infrastructure is at risk"})]})]})]})]}),e.jsxs("section",{className:"mb-12",children:[e.jsx("h2",{className:"text-2xl font-bold mb-6 text-emerald-400",children:"Grover and Symmetric Security Reduction"}),e.jsxs("div",{className:"bg-white/5 rounded-xl p-6 mb-6",children:[e.jsx("p",{className:"text-gray-300 mb-4",children:"While Grover's Algorithm doesn't break symmetric cryptography, it reduces its effective security by half:"}),e.jsxs("div",{className:"grid grid-cols-1 sm:grid-cols-2 gap-6",children:[e.jsxs("div",{className:"bg-white/5 p-4 rounded-lg",children:[e.jsx("h4",{className:"font-semibold text-white mb-2",children:"AES-128"}),e.jsx("p",{className:"text-sm text-gray-400",children:"Behaves like 64-bit security"})]}),e.jsxs("div",{className:"bg-white/5 p-4 rounded-lg",children:[e.jsx("h4",{className:"font-semibold text-white mb-2",children:"Solution"}),e.jsx("p",{className:"text-sm text-gray-400",children:"Upgrade to AES-256 minimum"})]})]})]})]}),e.jsxs("section",{className:"mb-12",children:[e.jsx("h2",{className:"text-2xl font-bold mb-6 text-emerald-400",children:'When is it Really Dangerous? The "Quantum Day" Factor'}),e.jsxs("div",{className:"bg-white/5 rounded-xl p-6 mb-6",children:[e.jsx("p",{className:"text-gray-300 mb-4",children:"Although universal quantum computers aren't yet a commercial reality, progress is rapid:"}),e.jsxs("ul",{className:"space-y-3",children:[e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(i,{className:"w-5 h-5 text-emerald-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"IBM, Google, IonQ, and Chinese companies are in an active race"})]}),e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(l,{className:"w-5 h-5 text-emerald-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"Breaking RSA-2048 requires about 4000 error-corrected qubits"})]}),e.jsxs("li",{className:"flex items-start space-x-3",children:[e.jsx(a,{className:"w-5 h-5 text-emerald-400 mt-1"}),e.jsx("span",{className:"text-gray-300",children:"Experts predict this capability between 2030-2035"})]})]})]})]}),e.jsxs("section",{className:"mb-12",children:[e.jsx("h2",{className:"text-2xl font-bold mb-6 text-emerald-400",children:"What Can Be Done Today? PQC Solutions"}),e.jsxs("div",{className:"bg-gradient-to-br from-emerald-500/10 to-blue-500/10 rounded-xl p-6 border border-emerald-500/20",children:[e.jsx("p",{className:"text-gray-300 mb-6",children:"NIST has selected quantum-resistant algorithms:"}),e.jsxs("div",{className:"grid grid-cols-1 sm:grid-cols-2 gap-6 mb-6",children:[e.jsxs("div",{children:[e.jsx("h4",{className:"font-semibold text-emerald-400 mb-2",children:"Selected Algorithms"}),e.jsxs("ul",{className:"space-y-2 text-sm text-gray-300",children:[e.jsx("li",{children:"⢠Kyber
1(encryption)"}),e.jsx("li",{children:"⢠Dilithium (signatures)"}),e.jsx("li",{children:"⢠SPHINCS+ (alternative)"})]})]}),e.jsxs("div",{children:[e.jsx("h4",{className:"font-semibold text-emerald-400 mb-2",children:"Implementation"}),e.jsxs("ul",{className:"space-y-2 text-sm text-gray-300",children:[e.jsx("li",{children:"⢠Hybrid encryption"}),e.jsx("li",{children:"⢠TLS migration"}),e.jsx("li",{children:"⢠Hardware support"})]})]})]}),e.jsxs(t,{to:"/q-vault",className:"inline-flex items-center space-x-2 text-emerald-400 hover:text-emerald-300 transition-colors",children:[e.jsx("span",{children:"Learn about Q-Vault's PQC implementation"}),e.jsx(r,{className:"w-4 h-4"})]})]})]}),e.jsx("section",{className:"mt-16",children:e.jsxs("div",{className:"bg-gradient-to-br from-emerald-500/10 to-blue-500/10 rounded-xl p-8 text-center",children:[e.jsx("h2",{className:"text-2xl font-bold mb-4 text-white",children:"Ready to Secure Your Future?"}),e.jsx("p",{className:"text-gray-300 mb-6",children:"Start implementing quantum-safe security today with Q-Vault."}),e.jsx(t,{to:"/q-vault",className:"inline-flex items-center justify-center px-6 py-3 rounded-lg bg-emerald-500 text-white hover:bg-emerald-600 transition-colors",children:e.jsxs("span",{className:"flex items-center space-x-2",children:[e.jsx("span",{children:"Explore Q-Vault"}),e.jsx(r,{className:"w-4 h-4"})]})})]})})]})]})}export{d as default};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.