![]() Shor’s algorithm quickly finds the prime factors of a large integer. However, once quantum computers enter the scene, cryptography experts expect RSA-based data security to quickly fall apart, thanks to Shor’s algorithm, which American mathematician Peter Shor developed in 1994 specifically for quantum computers, even though they did not yet exist. ![]() ![]() RSA encryption – named after its inventors: Rivest, Shamir, and Adleman – relies on the difficulty of decrypting the encoded data without a key, which requires some bodacious math to factor large numbers if you lack the encryption key.Īs computers have gotten faster, RSA keys have gotten longer to try to keep data secure. Today’s cryptography relies heavily on implementations of RSA public-key cryptography, which is now used pervasively for data encryption and decryption in networking and computing. The crisis du jour is the imminent breakdown of cryptographic security, thanks to the expected arrival of quantum computers. It seems, increasingly, like writing technology articles is becoming nothing more than covering a long list of unfolding crises.
0 Comments
Leave a Reply. |