Últimas notícias

Fique informado

Quantum Computing: Real or Exaggerated Threat to the Web PKI?


Twenty years ago, paying your phone or electric bill involved receiving it in the mail, writing a check and mailing it back to the company. Today, that has largely been replaced by email and web-based payment submittals.


Artigos em outros idiomas são publicados em International News | Articles in other languages are published in the International News 


All of this is secured by digital certificates and encryption, which provide privacy and authentication of information transiting the open Internet (aka Web PKI).

The web PKI is predominantly secured by RSA encryption algorithms; mathematical theorems which have been improved over time. These algorithms depend on the difficulty of computers in factoring large prime numbers in a reasonable time. The current state of binary computers would require 6.4 quadrillion (See: https://www.digicert.com/TimeTravel/math.htm) years to solve this mathematical problem and subsequently decrypt a message.

Quantum computers however could theoretically solve this problem much faster; it depends how big and fast your quantum computer is and it’s hard to get a reliable estimate since only trivially small ones exist right now. If ever realized, this would have a HUGE impact on the current web PKI which is depended upon by global e-commerce. Computers today are described as knowing two states: zero/one or on/off. These states are why at the lowest level, all programming resolves into binary code. Quantum computers on the other hand, can represent data using qubits.

Qubits are two-level quantum systems that can be manipulated into complex intermediate states, including states where the state of one qubit may depend on the states of one or more other qubits in complicated ways.  The idea that this could be used to perform computations that classical computers could not perform was suggested by Richard Feynman in 1982.  In 1994, Peter Shor gave an explicit algorithm for factoring numbers using a quantum computer, so how to factor numbers on a quantum computer has been known for a long time.

While Shor’s algorithm is based only on the quantum behavior of two-level systems, which have been understood for almost 100 years, implementing it in practice is a huge challenge.  For the large products of primes relevant to RSA, thousands of interacting qubits must be manipulated through a sequence of quantum states very precisely, and any premature interaction with the external environment with any qubit will cause its state to collapse.  Error correction methods exist to solve some of these problems, but at the cost of requiring even more qubits.  To date, this has generally restricted demonstrations of Shor’s algorithm to numbers that are of more interest to math students in grade school, rather than cryptographers.

Still, progress is being made, and there are a huge number of potential two-level quantum systems that could be used to construct a quantum computer.  It seems likely that sooner or later, someone will figure out how to efficiently construct a large number of qubits that are appropriately isolated and can be interacted with in the required manner.  If those problems can be overcome, there is little doubt that it would function correctly.  Toy systems have already demonstrated that the algorithm can be made to work in the real world.

For now, the web PKI is safe from Quantum computing. Is the threat real? We believe it is and several large companies are working to build proof-of-concept quantum computers that could revolutionize drug discovery, optimize car routes, or even assist with artificial intelligence. But the timing for a direct web threat is quite a few years away. Nevertheless, governments and industry have started reviewing ideas for “quantum-proof” algorithms that would be resistant to any foreseeable quantum computer threats.

The idea is that it will take time to propose algorithms, select the best ones, and get them implemented and deployed into all the systems that use RSA.  Transitioning to a new set of fundamental cryptographic algorithms is a problem that may prove to be as difficult, or more difficult, than building a quantum computer, and it is best that the industry begins thinking about the problem now so that solutions are available by the time large-scale quantum computers arrive.

Could nation states have already built quantum computers that solve the issues with the delicate nature of qubits? This is a good question and one that no one knows the answer to. However, given the current state of research in this area, it is unlikely that anyone has made such a quantum leap. So continue to pay your bills online, securely shop and whatever else you do when you see that lock in your browser. Remember sites use different types of certificates to secure their sites and those are described in our other blog here.

Fonte: Casecurity.org

Artigos em outros idiomas são publicados em International News | Articles in other languages are published in the International News 

Nenhum comentário até agora

Ir para a discussão

Nenhum comentário ainda!

Você pose ser o primeiro a iniciar a discussão.

Apenas usuários registrados podem comentar.