Back

Posted by

Explore a visual guide to how quantum computers can crack RSA encryption

In 1994, Peter Shor introduced an algorithm that showed a quantum computer could efficiently factor the product of two very large prime numbers, undermining the mathematics that makes RSA so secure. While using larger keys can delay the decryption time of quantum computers, this solution increases the time it takes to encrypt data, which may become impractical.

Similar Posts

Here’s what we found related to above. Click through to dive even deeper.

You've reached the end.