Chinese researchers at Tsinghua University think they have found a quantum-based algorithm that can defeat the most sophisticated encryption standards in use today.
The team asserts that current quantum technology can also be used to run the algorithm.
If this were the case, modern encryption’s lifespan may be substantially shortened to zero in a few years.
Long Guili, a professor at Tsinghua University, and his group assert to have created a brand-new factorization technique that saves qubits, which may cause issues for cryptographic security standards in the not-too-distant future.
The approach, known as sublinear-resource quantum integer factorization (SQIF), asserts to improve the efficiency of quantum computation by lowering the number of qubits needed for code-breaking operations.
The algorithm used in this work was created in 2013 by Claus Schnorr, a German researcher.
To someone who is not particularly knowledgeable about quantum computing, what does that mean? If the technique works, it may make it far more difficult than previously thought to crack the toughest encryption in use today utilizing quantum technologies.
SHA-256 is a cryptographic hashing technique developed by the National Security Agency (NSA) in 2001 that converts data into a 256-character encrypted string.
If the recipient doesn’t have the right key to decrypt the message, the encrypted output is illegible.
Decrypting a communication without the right keys is quite challenging because these decryption keys are likewise made up of intricate mathematical strings connected to the SHA-256 hash.
For instance, it is projected that it would take 300 trillion years or more to crack an RSA-2048-bit encryption key utilizing the most advanced classical computer resources available today.
300 trillion seems to be a lovely, safe quantity about which nobody needs to be concerned. That is, until quantum computers enter the picture, at least.
Experts in quantum mechanics and cryptography estimate that a decently sized quantum computer could do the same algorithm-breaking operation in less than eight hours. Guili’s calculation raises red flags in this situation.
The time it takes for quantum technology to advance enough to do the computations could be shortened from many decades to just a few years if the SQIF algorithm scales and successfully reduces the quantum computing resources needed to run the calculations.
To read our blog on “For diplomatic messages, France experiments with “post-quantum” encryption,” click here.
