Researcher Yilei Chen from Tsinghua University has published a study on a new algorithm that can accelerate solving certain parts of the Lattice problem, opening the door to developing encryption processes believed to be resistant to quantum computers. The Lattice problem is a challenge commonly used in quantum-resistant encryption processes, similar to the problem of factoring that is widely used in traditional encryption processes. Chen’s process indicates that quantum computers can successfully solve the learning with errors (LWE) problem within polynomial time, demonstrating the equivalency of the LWE problem to the Lattice problem in some forms.
NIST’s chosen quantum-resistant encryption standards, Kyber, and Dilithium, both leverage the Lattice problem as a foundation for development. However, neither standard was compromised by Chen’s process in this instance. Nevertheless, certain vulnerabilities exposed by this research may lead to the development of techniques that could potentially be used in actual encryption processes in the future.
This report is currently a preprint and has not undergone peer review prior to publication. Due to its significance, many quantum computing researchers are rigorously verifying its accuracy.
Source: Matthew Green, Cryptology ePrint Archive
Microsft researchers are currently collaborating with quantum computers.
TLDR: Researcher Yilei Chen introduces a new algorithm that accelerates solving parts of the Lattice problem, potentially impacting the future of quantum-resistant encryption development.
Leave a Comment