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.
The paper re-examines Dean and Goldsmith's proposed polynomial-time reduction from lattice problems to MIMO decoding, which adapted Regev's reduction for learning with errors (LWE). Prior works had presented attacks and counterexamples against the construction, leaving the reduction's precise validity unclear. The authors identify which structural features of the LWE reduction fail to transfer to the non-modular MIMO setting, showing the published proof does not establish the claimed hardness of MIMO decoding. They distinguish flaws in the hardness proof from direct attacks on specific parameter choices and do not rule out physical layer security for MIMO systems in general.
- Dean-Goldsmith reduction from lattice problems to MIMO decoding adapted Regev's LWE reduction.
- Structural LWE features fail to carry over to the non-modular MIMO setting.
- Published proof does not establish the claimed hardness of MIMO decoding.
- Results separate proof flaws from attacks on particular parameter choices.
- Physical layer security for MIMO is not ruled out in general.
From the original article
1 min read at arxiv.orgMultiple-input multiple-output (MIMO) technology is fundamental to modern wireless communication. Physical layer security seeks to protect transmitted information by exploiting properties of the noisy communication channel. Dean and Goldsmith proposed a polynomial time reduction from lattice problems to MIMO decoding by adapting Regev's reduction for learning with errors (LWE).
By Yang Li · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.