International Association for Cryptologic Research

International Association
for Cryptologic Research

Advances in Cryptology – ASIACRYPT 2025

On the Provable Dual Attack for LWE by Modulus Switching


Hongyuan Qu
School of Cyber Science and Technology, Shandong University, China

Guangwu Xu
School of Cyber Science and Technology, Shandong University and State Key Laboratory of Cryptography and Digital Economy Security and Shandong Institute of Blockchain, China


Keywords: LWE, Provable Dual Attack, Poisson Summation Formula, Modulus Switching, Chinese Remainder Theorem


Abstract

As a theoretical cornerstone of post-quantum cryptography, the Learning With Errors (LWE) problem serves as the security foundation for standardized algorithms such as Kyber and Dilithium. Recently, a framework for provable dual attacks on LWE has been proposed by Pouly et al. in Eurocrypt 2024, addressing the limitations in effectiveness caused by existing methods' reliance on heuristic assumptions in LWE dual attacks. Their paper also poses an open problem on how to formally integrate modulus switching into this framework to reduce attack costs. The main purpose of this paper is to give a solution of this open problem by presenting an improved provable dual attack method that incorporates modulus switching and Chinese Remainder Theorem (CRT) techniques. First, we design a modulus switching mechanism that eliminates practical errors via the Poisson summation formula. By embedding the inherent noise from modulus switching into a rational lattice framework, our approach effectively preventing the risk of attack failure caused by the merging of such errors with LWE noise. Theoretical guarantees (Theorems 4 and 5) rigorously quantify the parameter ranges for successful attacks. Second, we introduce a CRT-based secret recovery method that aggregates partial secrets from independent sub-attacks. By leveraging the Chinese Remainder Theorem to reconstruct full secrets from congruence relations, our method adapts to arbitrary secret distributions. Furthermore, by using a tighter variant of Banaszczyk's measure inequality, we obtain a precise parameter range for the dual attack's efficacy through rigorous mathematical proof, and achieve the same complementary gap with the contradictory regime (proposed by Ducas et al.) as in Pouly et al.'s work. Experiments show 15-29 bit superior performance in attack estimation compared to the original framework.

Publication

Advances in Cryptology – ASIACRYPT 2025. ASIACRYPT 2025. Lecture Notes in Computer Science, vol 16247. Springer, Singapore.

Paper

Artifact

Artifact number
asiacrypt/2025/a14

Artifact published
December 31, 2025

Badge
IACR Artifacts Functional

README

ZIP (6911 Bytes)  

License
This work is licensed under the MIT License.

Note that license information is supplied by the authors and has not been confirmed by the IACR.


BibTeX How to cite

Qu, H., Xu, G. (2026). On the Provable Dual Attack for LWE by Modulus Switching. In: Hanaoka, G., Yang, BY. (eds) Advances in Cryptology – ASIACRYPT 2025. ASIACRYPT 2025. Lecture Notes in Computer Science, vol 16247. Springer, Singapore. https://doi.org/10.1007/978-981-95-5099-9_2. Artifact available at https://artifacts.iacr.org/asiacrypt/2025/a14