Could Shor's algorithm be applied to crack ECDSA? I'm not sure.
Shor's algo is about factoring large prime integers. In ECDSA there is an additional difficulty, as the algebra is not about integers but points of an elliptc curve. Has anyone shown that solving the former permits solving the latter?
Topic: First simple factorization solved by quantum computing - page 2. (Read 2755 times)
Physicists demonstrate that 15=3x5 about half of the time
The device in the photomicrograph was used to run the first solid-state demonstration of Shor's algorithm. It is made up of four phase qubits and five superconducting resonators, for a total of nine engineered quantum elements. The quantum processor measures one-quarter inch square
[...]
"Fifteen is a small number, but what's important is we've shown that we can run a version of Peter Shor's prime factoring algorithm on a solid state quantum processor. This is really exciting and has never been done before," said Erik Lucero, the paper's lead author. Now a postdoctoral researcher in experimental quantum computing at IBM, Lucero was a doctoral student in physics at UCSB when the research was conducted and the paper was written. "What is important is that the concepts used in factoring this small number remain the same when factoring much larger numbers," said Andrew Cleland, a professor of physics at UCSB and a collaborator on the experiment. "We just need to scale up the size of this processor to something much larger. This won't be easy, but the path forward is clear."
While this is a far cry to begin to worry for the decryption of our private bitcoin keys, it nonetheless is a notable starting point.
Anyone has in depth information on how and if this kind of technology could evolve to the point to crack all existing encryption schemes?
The device in the photomicrograph was used to run the first solid-state demonstration of Shor's algorithm. It is made up of four phase qubits and five superconducting resonators, for a total of nine engineered quantum elements. The quantum processor measures one-quarter inch square
[...]
"Fifteen is a small number, but what's important is we've shown that we can run a version of Peter Shor's prime factoring algorithm on a solid state quantum processor. This is really exciting and has never been done before," said Erik Lucero, the paper's lead author. Now a postdoctoral researcher in experimental quantum computing at IBM, Lucero was a doctoral student in physics at UCSB when the research was conducted and the paper was written. "What is important is that the concepts used in factoring this small number remain the same when factoring much larger numbers," said Andrew Cleland, a professor of physics at UCSB and a collaborator on the experiment. "We just need to scale up the size of this processor to something much larger. This won't be easy, but the path forward is clear."
While this is a far cry to begin to worry for the decryption of our private bitcoin keys, it nonetheless is a notable starting point.
Anyone has in depth information on how and if this kind of technology could evolve to the point to crack all existing encryption schemes?
Jump to: