The encryption algorithm is always more than just Riemann's conjecture.

  

 The encryption algorithm is always more than just Riemann's conjecture.

The image above: Quadratic formula

(Wikipedia, Quadratic formula)

The simple algorithm quadratic formula is a good explanation of how the quantum computer will handle data. The formula is well-known from college, and it's easy to cut into pieces. So the quantum computer will cut the formula into pieces. And every part of it will send to different routes. That thing makes the work of computers lighter. 

When we are thinking that encryption algorithms are easy to break. We mean encryption that is used only Riemann's conjecture. But if we connect Riemann's conjecture with some other algorithms like quadratic formulas or Euler's equation. That increases the safety of the algorithms.

So the encryption algorithm might look like this: (ASCII-code*(Riemann's conjecture), Euler's equation*...) There are no limits for the type and number of those algorithms. That is connected with Riemann's conjecture. The name of that formula is also Riemann's hypothesis or Riemann's zeta-function. And there might be an answer 1/2. 

But that formula is still useful for prime number generators. And if that is connected with other mathematical functions it can still serve as part of encryption algorithms. 

Have you ever heard the term "jumping algorithm"? In the simplest model, every ASCII mark in the message is encoded by using a unique prime number. But in the higher level of encoding. Every each mark of the message is encrypted by using individual encryption formula. 

When quantum computer simply uses division law. It can make that kind of formula turn lighter. The thing is that this kind of example shows why code-breaking is easier to make by using quantum computers than regular computers. 

The formula that encrypts the message can be like this: (ASCII-code*(Riemann's conjecture)*(quadratic formula)). This thing means another formula that covers Riemann's conjecture. Or maybe Riemann's conjecture will use multiple times. In that case, at the first, the system would multiplicate the ASCII codes of the message. 

The term "double algorithm" means that Riemann's conjecture is connected to another mathematical formula. The fact is that the number of those formulas is unlimited. And they can be any accepted mathematical formula. So the quadratic formula is only an example of the mathematical function formula connected with Riemann's conjecture.  

By using a series of prime numbers. Those numbers are created by using Riemann's conjecture. The thing is that they might be a series of quantum decimal prime numbers. And then the next formula would mess those numbers even more. The thing is that those formulas can be any possible mathematical formula. And the only necessary thing is that the receiving system must have the ability to calculate those calculations backward. 

The thing in secrecy or encryption algorithms is. They are not simple Riemann's conjectures. Those formulas might involve Riemann's conjecture but they are not just those conjectures. High-power computers can break any code in the world. So there is necessary to make the algorithms or mathematical formulas that are making the code-breaking harder. 

And of course, the system can use so-called virtual algorithms. In those very complicated systems, all messages are not using even secrecy. They are using extremely long decimal numbers for hiding data. But only important messages are using the quantum decimal binary numbers. And the mission for that thing is that their purpose is to slow the work of the code-breaking system. 

The idea is that there might be three or five very easy prime numbers that might be from the beginning of the series. The thing is that when the attacking system breaks code. It must test every single prime number to the captured message. 

https://en.wikipedia.org/wiki/Riemann_hypothesis

https://thoughtsaboutsuperpositions.blogspot.com/