QUANTUM COMPUTING IS IT POSSIBLE? The nature of quantum computers—computers that use qubits instead of just traditional bits—makes it possible to implement algorithms that cannot be implemented on classical computers, and these dramatically affect the security of some encryption algorithms.
In particular, a quantum technique called Shor's algorithm can factor large numbers exponentially faster than classical machines. That ability means a quantum computer could crack systems like RSA, a widely used method for encrypting data.
One of the most frequently asked questions about quantum computing relates to how long before a quantum computer can break a public key cryptography code such as RSA-2048. Most of the time, the response is a general answer of “perhaps 10 years or more”.
The nature of quantum computers—computers that use qubits instead of just traditional bits—makes it possible to implement algorithms that cannot be implemented on classical computers, and these dramatically affect the security of some encryption algorithms.In particular, a quantum technique called Shor's algorithm can factor large numbers exponentially faster than classical machines. That ability means a quantum computer could crack systems like RSA, a widely used method for encrypting data.One of the most frequently asked questions about quantum computing relates to how long before a quantum computer can break a public key cryptography code such as RSA-2048. Most of the time, the response is a general answer of “perhaps 10 years or more”.
0 Comments
please do not use abusive language