Changes

In the future (assumed to be at least 50 years away if ever),<ref>[https://eprint.iacr.org/2021/1637.pdf 8 Conclusions, Internet Security and Quantum Computing by Hilarie Orman, Dec 2021]</ref> large-scale quantum computers might be able to solve problems that are impossible with current computing technology because quantum computers can handle many complex processes at the same time. Such "cryptographically relevant quantum computers" (CRQCs) could find a break in an RSA or D-H scheme (which today is practically impossible) in a day or less. Post-quantum cryptography (PQC) algorithms should not be susceptible to quantum computers because they are fundamentally different from the RSA and the Diffie-Hellman. That is, they are not weakened by Shor’s algorithm.<ref>[https://news.mit.edu/2016/quantum-computer-end-encryption-schemes-0303 The beginning of the end for encryption schemes? MIT News, Jennifer Chu]</ref><ref>[https://www.icann.org/en/system/files/files/octo-031-11feb22-en.pdf Quantum Computing and the DNS, Paul Hoffman, ICANN OCTO-031]</ref>  

In the future (assumed to be at least 50 years away if ever),<ref>[https://eprint.iacr.org/2021/1637.pdf 8 Conclusions, Internet Security and Quantum Computing by Hilarie Orman, Dec 2021]</ref> large-scale quantum computers might be able to solve problems that are impossible with current computing technology because quantum computers can handle many complex processes at the same time. Such "cryptographically relevant quantum computers" (CRQCs) could find a break in an RSA or D-H scheme (which today is practically impossible) in a day or less. Post-quantum cryptography (PQC) algorithms should not be susceptible to quantum computers because they are fundamentally different from the RSA and the Diffie-Hellman. That is, they are not weakened by Shor’s algorithm.<ref>[https://news.mit.edu/2016/quantum-computer-end-encryption-schemes-0303 The beginning of the end for encryption schemes? MIT News, Jennifer Chu]</ref><ref>[https://www.icann.org/en/system/files/files/octo-031-11feb22-en.pdf Quantum Computing and the DNS, Paul Hoffman, ICANN OCTO-031]</ref>  

===Hurdles===

===Hurdles to Quantum Computing===

It is very difficult to build even very small quantum computers.<ref>[https://eprint.iacr.org/2021/1637.pdf 3.3 What are the Challenges Facing Quantum Computer Development?, Internet Security and Quantum Computing by Hilarie Orman, Dec 2021]</ref>  

It is very difficult to build even very small quantum computers.<ref>[https://eprint.iacr.org/2021/1637.pdf 3.3 What are the Challenges Facing Quantum Computer Development?, Internet Security and Quantum Computing by Hilarie Orman, Dec 2021]</ref>  

First, the information in qubits is very fragile, so qubits must be completely isolated from the external environment and kept at temperatures near zero degrees Kelvin during computations, which takes extensive machinery and physical space. Second, qubits are highly prone to errors during processing, which requires thousands of additional cooled qubits to correct errors for every qubit in the computation. <br/>

First, the information in qubits is very fragile, so qubits must be completely isolated from the external environment and kept at temperatures near zero degrees Kelvin during computations, which takes extensive machinery and physical space. Second, qubits are highly prone to errors during processing, which requires thousands of additional cooled qubits to correct errors for every qubit in the computation. <br/>