Skip to main content

The laptop computer broke in 53 hours an encryption code, which prevented to deny the quantum-computer attack.




This thing shows the weakness of quantum computers. The error handling and disturbing handling are not yet effective enough. And another thing is that quantum computers are not so usual things that they will turn to regular tools for programmers. 

The thing is that there are no programmers on Earth who have so-called large-scale experience of working with quantum computers. So without error-handling. There is a large number of errors in the program code and algorithms. That is made by using quantum computers. 

What part of the broken algorithm was made by using the quantum computer? That thing is not mentioned in the news. That is linked below this text. The fact is that the encryption codes that are made by using binary computers are useless against the quantum computer. 

There is the possibility that quantum computers are used only to generate the prime number that is used in the encryption process. If the algorithms are made by using binary computers. There would be no problem for breaking it with a quantum computer. 


x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x


The zero-point in the Riemann hypothesis causes the re-estimation of the encryption that uses prime numbers. 


The computers are using Riemann conjecture that is also known as Riemann conjecture for that purpose. There are zero points in that conjecture or "Zeta function". So there should be found some other way to create prime numbers. 



Image: Zero-points in Riemann hypothesis. 


"The real part (red) and imaginary part (blue) of the Riemann zeta function, along with the critical line Re(s) = 1/2. The first nontrivial zeros can be seen at lm(s) = ±14.135, ±21.022, and ±25.011". (Wikipedia/Riemann hypothesis)

Even if there is a zero-point in Riemann's conjecture in the point Re(s) 1/2. There is a possibility to generate prime numbers by using this formula. If there are only a couple of zero points. Into the program code must just involve a command. That denies using of those points. ("Don't use the point Re(s)=1/2)" would be the command). 

But as you see from the film at the top of this text there are five zero points in the Riemann zeta function that is also known Riemann hypothesis and Riemann conjecture. There is the possibility that there are more zero points. And if the Riemann Zeta function is used in the encryption algorithm. Those points should involve to "don't use list". 

But in higher-level encryption that is needed in the most secured data transmission, there is the possibility that Riemann conjecture or hypothesis is not enough to reach the Pretty Good Privacy level in the highest secured data transmission. 


x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x



The hacker cannot predict time what breaking the algorithms takes. 


When we are thinking that the hacker uses 53 hours to crack some algorithm we must remember one thing. Before the code-braking process, the hacker cannot predict how long that process takes. So when the code braking process begins the system can handle that problem from one minute to 10000 hours. And as you see code-braking requires patience. 

But maybe quantum computers are not very common systems yet. Yet those systems are not creating the large-scale risk for the things like crypto-currencies. Those computers are in well-guarded laboratories. But in the future, the situation will change. 

The quantum computers turn more common. And those systems turn private-owned. Also, the experience of programming and error-handling in quantum computing will advance. And that makes it possible that quantum computers will scale themselves across the internet. When we are thinking about quantum computers. They will repeat the history of computers. The first computers were in laboratories. 

And they were used by very highly trained people. But then those systems turned more common, cheaper and finally, even ordinary people could find those things. The Apple's Lisa and IBM PC (Personal Computer) was the first breakthrough for computers. The second breakthrough was the pocket-size mobile devices or "smartphones". That allows people to be connected to the internet all the time. 

And then we might think that the quantum computers are following this way. Maybe sooner than we think we can see the quantum-personal computers in the supermarkets. 


https://english.elpais.com/science-tech/2022-03-24/using-just-a-laptop-an-encryption-code-designed-to-prevent-a-quantum-computer-attack-was-cracked-in-just-53-hours.html


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


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


https://miraclesofthequantumworld.blogspot.com/

Labels:

Comments

Post a Comment

Popular posts from this blog

Quantum breakthrough: stable quantum entanglement at room temperature.

"Researchers have achieved quantum coherence at room temperature by embedding a light-absorbing chromophore within a metal-organic framework. This breakthrough, facilitating the maintenance of a quantum system’s state without external interference, marks a significant advancement for quantum computing and sensing technologies". (ScitechDaily, Quantum Computing Breakthrough: Stable Qubits at Room Temperature) Japanese researchers created stable quantum entanglement at room temperature. The system used a light-absorbing chromophore along with a metal-organic framework. This thing is a great breakthrough in quantum technology. The room-temperature quantum computers are the new things, that make the next revolution in quantum computing. This technology may come to markets sooner than we even think. The quantum computer is the tool, that requires advanced operating- and support systems.  When the support system sees that the quantum entanglement starts to reach energy stability. I
Post a Comment
Read more

The anomalies in gravity might cause dark energy.

"Physicists at UC Berkeley immobilized small clusters of cesium atoms (pink blobs) in a vertical vacuum chamber, then split each atom into a quantum state in which half of the atom was closer to a tungsten weight (shiny cylinder) than the other half (split spheres below the tungsten). (ScitechDaily, Beyond Gravity: UC Berkeley’s Quantum Leap in Dark Energy Research) By measuring the phase difference between the two halves of the atomic wave function, they were able to calculate the difference in the gravitational attraction between the two parts of the atom, which matched what is expected from Newtonian gravity. Credit: Cristian Panda/UC Berkeley" (ScitechDaily, Beyond Gravity: UC Berkeley’s Quantum Leap in Dark Energy Research) Researchers at Berkeley University created a model that can explain the missing energy of the universe. The idea is that the particles and their quantum fields are whisk-looking structures. Those structures form the superstrings that are extremely thi
Post a Comment
Read more

Neon and time crystals can be the new tools for quantum computing.

"New research investigates the electron-on-solid-neon qubit, revealing that small bumps on solid neon surfaces create stable quantum states, enabling precise manipulation. This research, supported by multiple foundations, emphasizes the importance of optimizing qubit fabrication, moving us closer to practical quantum computing solutions." (ScitechDaily, Quantum Riddle Solved? How Solid Neon Qubits Could Change Computing Forever) Researchers created a superposition in solid neon. And those neon ions, where the system creates superposition in their surfaces.  Making it possible to manipulate those atoms. The atom-based qubit has one problem. Orbiting electrons cause turbulence in their quantum fields. The thing that can solve the problem is to use the quantum fields for the superposition.  If the system can position electrons at a certain point, it can make a small hill to the atom's surface. And the system can use that thing for making quantum superposition between the mos
Post a Comment
Read more