Cyclotomic Cosets: Hidden Subgroup and Quantum Sieving Algorithm for Prime-Power Moduli

The Learning With Errors (LWE) problem is a fundamental assumption in post-quantum cryptography. Regev established a quantum reduction from LWE to the Dihedral Coset Problem (DCP). Later, Brakerski et al. introduced the Extrapolated Dihedral Coset Problem (EDCP), proving its equivalence to LWE. However, unlike DCP, EDCP no longer admits a coset structure. This limits the direct application of techniques for hidden subgroup problems. In this work, we introduce the Cyclotomic Coset Problem (CCP), a cyclotomic generalization of DCP that preserves an exact hidden-subgroup structure. Let ζ p be a primitive p-th root of unity, let π=ζ p-1, and write q=p t and L=t(p-1). We work over R q= Z q[ζ p] Z[ζ p]/(π L), where the isomorphism follows from the total ramification identity (p)=(π) p-1. We exploit the resulting π-adic ideal chain to construct a quantum sieve that successively reduces phase states modulo π L,π L-1,,π. For every fixed prime p and modulus q=p t, our algorithm solves the CCP in time and sample complexity 2 O p(n q), using polynomial quantum space. The sieve also applies to uniform EDCP and Gaussian SLWE>, yielding quasi-polynomial time algorithms for all the above problems when q= poly(n). This extends the power-of-two EDCP sieve of Bai et al. (CRYPTO 2025) to a cyclotomic setting. However, we emphasize that our result does not, by itself, yield a quasi-polynomial-time algorithm for standard LWE, because the currently known reduction produces only a limited number of approximate CCP states.