Survey maps lattice assumptions if the Dihedral Coset Problem falls
A refuted 2026 quantum-algorithm claim frames which assumptions would move and which deployed parameters would not.
Stories per day · 30 days
1 RSS
Relateddihedral-coset-problem1ethereum1evm1fhe1lattice-cryptography1ml-kem1post-quantum1privacy1threshold-cryptography1threshold-decryption1
9 stories, newest first · one card per story
Stories tagged #lwe
Tulva: Practical Asynchronous Threshold FHE
Tulva adds practical asynchronous threshold decryption to base FHE schemes, with millisecond EVM-oriented benchmarks.
Provably Subexponential Algorithms for Bounded-Error LWE with Few Samples
A Kirchner–Fouque BKW variant solves bounded-error LWE subexponentially with near-linear samples.
Sample-Preserving Search-to-Decision Reduction for Noisy Linear Equations over Large Moduli
Researchers give a sample-preserving search-to-decision reduction for noisy linear equations that stays polynomial for exponential moduli.
Exponential quantum speedup for $\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE
Quantum algorithms solve ternary vector subset-sum with fewer samples, backed by rigorous classical binary-error LWE methods.
Classical Verification of Quantum Computation with Quasilinear Resources, from Compiled Nonlocal Games
Researchers give a classical verifier a quasilinear-cost argument system for BQP under LWE.
Cyclotomic Cosets: Hidden Subgroup and Quantum Sieving Algorithm for Prime-Power Moduli
A cyclotomic quantum sieve solves CCP and related EDCP cases quickly, but not standard LWE.
I Prove, Therefore I Am: Spatiotemporal Multi-Party Computation
Researchers propose spatiotemporal MPC that keeps location and time private yet physically consistent.
Has MIMO decoding been proved hard from lattice problems?
Researchers show the published lattice-hardness proof for MIMO decoding fails, as Regev's LWE reduction structure does not carry over to non-modular MIMO.