Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchSiguranță AI

analiza aiqbench

Recent research indicates that the qubit threshold required to break standard RSA and ECC encryption has dropped significantly, potentially reaching 10,000 physical qubits by 2026. This acceleration in quantum capability shortens the timeline for a cryptographically relevant quantum computer, posing an imminent threat to current digital security infrastructures. Organizations must now prioritize post-quantum cryptography migration strategies to safeguard sensitive data against these evolving computational risks.
Surse care acoperăPhysics World, Quantum Zeitgeist, InfoQ, Inside Quantum Technology
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

New findings shorten the road to cryptographically relevant quantum computers

Physics World8 min de cititArticolul și perspectiva sunt în engleză.

Two recent papers suggest that quantum computers may crack modern cryptography sooner than expected The post New findings shorten the road to cryptographically relevant quantum computers appeared first on Physics World.

Celebrity gossip might break the Internet, but not in the way that quantum computers could. “The advent of quantum computers poses a critical threat, as they could break widely deployed encryption schemes,” warns Lily Chen, a cryptography expert from the US National Institute of Standards and Technology (NIST). Systems at risk include banking encryption, digital signatures, secure messaging, secure shell tunnelling, cryptocurrency and more. Today’s quantum computers are still too small and error-prone to defeat gold-standard encryption. However, new results from Google Quantum AI and start-up Oratomic suggest that could change, with two widely used cryptographic systems – elliptic curve cryptography (ECC) and the Rivest-Shamir-Adleman (RSA) algorithm – potentially coming under threat sooner than many scientists predicted. At present, anyone who wants to access encrypted information needs a secret digital key. To obtain this key, an attacker must first solve a difficult mathematics problem. For example, breaking the RSA algorithm boils down to factoring a large number into its prime components. Breaking…

Extras afișat conform termenilor RSS ai publicației · 162 cuvinte · textul integral și figurile sunt pe site-ul publicației

Subiecte conexe