Clever Geek Handbook

Can quantum algorithms be used for encryption?

Can quantum algorithms be used?

Has anyone succeeded in applying quantum algorithms?

+1


source to share


7 replies


"Quantum algorithms" are algorithms that must be executed on quantum computers.

There are things that can be done quickly in a quantum computation model that are unknown (or thought to be) possible with classical computation: Discrete Logarithm and Integer Factorization (see Shor's algorithm ) are in BQP , but not considered to be in P (or BPP ). Thus, when / if a quantum computer is built, it is known that it can break RSA and the latest cryptography.

However



  • quantum computers cannot (do not count, I mean) solve NP-complete problems in polynomial time and, more importantly,
  • no one has built a quantum computer yet, and it is not even clear if one can be built - to avoid decoherence, etc. (There have been claims of quantum computers with a limited number of qubits - 5 to 10, but obviously they are not useful to anyone.)
"Well, there is a quantum computer that can factor 15, so those of you using 4-bit RSA should worry." - Bruce Schneier

[There is also the idea of ​​quantum cryptography, which is quantum channel cryptography and something completely different from quantum computing.]

+7


source


The only logical answer is that they are useful and not useful .; -)



+5


source


I understand that modern quantum computing capabilities can be used to securely exchange keys. The exchanged keys can then be used to perform traditional cryptography.

+2


source


As far as I know about quantum computing and algorithms. I've seen quite a few uses of quantum algorithms in cryptography. If you are really interested in crypto, please check these things out. In any case, it's all about how well you know the basics of quantum mechanics and discrete mathematics. For example: you should be seeing complex algorithms like Shor's algorithm, this fundamentally integer factorization. Basic integer factorization is simple, using the usual algorithms Algebraic group factorization algorithm, Fermat..etc factorization method, but when it comes to Quantum Computing, it is completely different, you work on Quantum computers, so the algorithm changes and we have to use algorithms. such as Shor, etc.

Mainly good at quantum computing and then looking at quantum algorithms

+2


source


There is also some research on whether quantum computing can be used to tackle difficult problems like factoring large numbers (if it could, it would break modern encryption techniques).

0


source


Stackoverflow runs on a quantum computer.

Feynman implied the possibility that quantum probability is the source of human creativity.

The faces in the crowd present the answers and vote on them only with the probability of being correct. Only by polling the crowd many times can the probability be raised to a confident level.

So maybe Stackoverflow is considering a successful implementation of a quantum algorithm.

What do you think?

0


source


One good use of a quantum device that can be made with current technology is a random number generator.

The generation of truly random bits is an important cryptographic primitive and is used, for example, in the RSA algorithm to generate a private key. On our PC, the random number generator is not random at all in the sense that the source has no entropy in it and, therefore, is not random at all.

0


source






More articles:


All Articles