Professor Tsuyoshi Takagi and his team have successfully developed a new algorithm that rapidly solves the “MQ problem” which is central to evaluating the security of next-generation post-quantum cryptography designed to remain secure even after quantum computers become operational. Using a mathematical tool known as a Hilbert series, they proposed a new method that identifies the combinations truly necessary for the calculation and keeps the matrices small throughout the entire computational process, thereby successfully solving the “MQ problem,” which is considered 47,000 times more difficult than the previous record. These findings will be published in the July 17 issue of “IACR Transactions on Cryptographic Hardware and Embedded Systems 2026 (TCHES2026)” and are scheduled to be presented at the international cryptography conference “CHES2026” to be held in Antalya, Turkey, for five days starting October 11.
[Link]