Chinese researchers claim they have broken AES encryption using quantum computer
Chinese researchers claim to have executed the first effective quantum attack on encryption algorithms, posing a significant threat to AES standards, though current technology limits immediate risks to cryptographic systems.
Read original article
Chinese researchers have reportedly achieved a significant milestone in quantum computing by successfully executing what they claim is the first effective quantum attack on widely used encryption algorithms. Utilizing a D-Wave quantum computer, the team, led by Wang Chao from Shanghai University, targeted algorithms integral to the Substitution-Permutation Network (SPN) structure, which underpins advanced encryption standards (AES) commonly used in military and financial sectors. Although the researchers have not yet cracked specific passcodes, they assert that their work poses a "real and substantial threat" to current encryption methods. The study, published in the Chinese Journal of Computers, highlights the potential vulnerabilities of AES-256, often regarded as military-grade encryption. Despite this advancement, the researchers acknowledged limitations such as environmental interference and the need for more developed hardware, which currently restrict the full potential of quantum attacks. The D-Wave Advantage quantum computer, initially designed for non-cryptographic applications, employs quantum annealing techniques to solve complex mathematical problems more efficiently than traditional methods. While the research indicates progress, the scientists caution that the technology is still in its early stages, and immediate risks to modern cryptographic systems remain limited.
- Chinese scientists claim to have executed the first successful quantum attack on encryption algorithms.
- The research poses a significant threat to military and financial encryption standards.
- Limitations in current quantum technology hinder the full potential of these attacks.
- The D-Wave Advantage quantum computer was used for the research, employing quantum annealing techniques.
- Immediate risks to existing cryptographic systems are still considered limited.
Related
A Quantum Leap in Factoring
Recent quantum computing advancements include Peter Shor's Shor algorithm for factoring large numbers and Oded Regev's new scheme reducing gate requirements. Practical implications and implementation challenges persist despite optimism for future cryptography improvements.
Quantum Cryptography Has Everyone Scrambling
Countries are advancing in quantum cryptography, with China leading in quantum key distribution (QKD). A hybrid approach combining QKD and post-quantum cryptography (PQC) is considered most effective for secure communications.
Quantum Cryptography Has Everyone Scrambling
Global efforts are advancing quantum key distribution (QKD) systems alongside post-quantum cryptography (PQC), with China leading research, while a hybrid approach may enhance future secure communications and a quantum internet.
NIST Releases First 3 Finalized Post-Quantum Encryption Standards
NIST has finalized three post-quantum encryption standards to protect against quantum computer attacks, urging immediate implementation by system administrators. The standards include algorithms for encryption and digital signatures.
Google uncovers how quantum computers can beat today's best supercomputers
Researchers at Google have shown that quantum computers can surpass classical supercomputers under specific noise conditions, emphasizing noise management's role in achieving quantum advantage and driving advancements in both technologies.
2 commentsThey provide a link to what they claim to be the original research paper
http://cjc.ict.ac.cn/online/onlinepaper/wc-202458160402.pdf
This in in Chinese, but it has an English abstract. The abstract says nothing about AES or about any other similar encryption algorithm. It says only about a progress towards breaking RSA, i.e. that they have factorized a 22-bit number using a novel algorithm run on a D-Wave "quantum" (annealing) computer.
This is above what quantum computers can currently do, but it is a long way from breaking 2048-bit or 4096-bit RSA.
It has nothing to do with AES. In the parent article, unlike in the research paper, something completely different is described, which seems to be about breaking some toy block ciphers that have nothing to do with AES, but which also have a SPN (substitution-permutation network) structure.
SPN is a generic way of constructing an invertible function. Breaking any SPN cipher does not bring you any closer to breaking a different SPN cipher.
So nothing written there supports any danger to AES.
AES does have a particular algebraic structure, which makes breaking AES equivalent with solving a certain immense system of equations. There exists a very remote possibility that someone could discover an algorithm to solve this system of equations.
Nevertheless, in the unlikely event that this would happen, there are trivial modifications to AES that would have negligible or no effect on its performance, which would remove its equivalence with that system of equations, making impossible such mathematical attacks (such a change would be the substitution of some XOR operations from AES with integer additions; this needs only software changes for the applications run on computers with Intel/AMD or Arm CPUs). Therefore any such mathematical breakthrough would affect only the past recorded messages, because it would be easy to modify AES to keep secure the future communications.
> According to SCMP, the research team employed the D-Wave Advantage quantum computer to target the Present, Gift-64, and Rectangle algorithms, called key representatives of the Substitution-Permutation Network (SPN) structure. This structure is foundational for advanced encryption standards (AES), a system widely deployed in military and financial encryption protocols, according to the newspaper. While AES-256 is often labeled as military-grade and considered the most secure encryption standard available, the study suggests that quantum computers may soon threaten such security.
Related
A Quantum Leap in Factoring
Recent quantum computing advancements include Peter Shor's Shor algorithm for factoring large numbers and Oded Regev's new scheme reducing gate requirements. Practical implications and implementation challenges persist despite optimism for future cryptography improvements.
Quantum Cryptography Has Everyone Scrambling
Countries are advancing in quantum cryptography, with China leading in quantum key distribution (QKD). A hybrid approach combining QKD and post-quantum cryptography (PQC) is considered most effective for secure communications.
Quantum Cryptography Has Everyone Scrambling
Global efforts are advancing quantum key distribution (QKD) systems alongside post-quantum cryptography (PQC), with China leading research, while a hybrid approach may enhance future secure communications and a quantum internet.
NIST Releases First 3 Finalized Post-Quantum Encryption Standards
NIST has finalized three post-quantum encryption standards to protect against quantum computer attacks, urging immediate implementation by system administrators. The standards include algorithms for encryption and digital signatures.
Google uncovers how quantum computers can beat today's best supercomputers
Researchers at Google have shown that quantum computers can surpass classical supercomputers under specific noise conditions, emphasizing noise management's role in achieving quantum advantage and driving advancements in both technologies.