Condensed matter theory physicist and quantum information expert Sankar Das Sarma has argued in MIT Technology Review that quantum computers remain a very long way away from cracking RSA-based cryptography.
RSA-Cryptography utilizes algorithms, codes and keys to securely encrypt private data without interference from third parties or malicious actors such as hackers. An example of the methodology in crypto is with the creation of a new wallet that generates a public address and private key.
Quantum security is seen as a major issue in the blockchain and crypto sector and it is widely believed that powerful quantum computers will one day become advanced enough to hack current cryptography. That could result in the theft of billions of dollars worth of digital assets, or bring blockchain tech to a grinding halt. There are numerous projects devoted to developing quantum proof cryptography and blockchains.
Sarma currently serves as the director of the University of Maryland’s condensed matter theory center and outlined his thoughts earlier this week via an article for Technology Review.
The physicist said that he was “disturbed by some of the quantum computing hype I see these days” and liked the current state of the technology to “a tremendous scientific achievement” but one which takes us “no closer to having a quantum computer that can solve a problem that anybody cares about.”
The physicist highlighted that prime factorization in which a “quantum computer can solve the hard problem of finding the prime factors of large numbers exponentially faster than all classical schemes” and crack cryptography is currently well beyond the grasp of current computing power.
Sarma pointed to “qubits” which are quantum objects like an
Read more on cointelegraph.com