Cryptographic methods such as [[Rivest-Shamir-Adleman Algorithm|RSA]] (Rivest-Shamir-Adleman) could be cracked by a fully developed, [[Fault-Tolerant Quantum Computer|fault-tolerant quantum computer]]. Their security is based on the assumption that large numbers cannot be broken down into their prime factors easily (and especially not in a short time). But that is exactly what a quantum computer could do with the help of the [[Shor Algorithm|Shor algorithm]]. In order to protect data from attacks by quantum computers, other methods are therefore required. *Post-quantum cryptography* includes classic encryption methods that are also secure against attacks by [[Quantum Computer|quantum computers]]. >[!read]- Further Reading >- [[Encryption]] >- [[Quantum Key Distribution]] >[!ref]- References