Metraipolis › archive › dc_76914dc1bdb2

Has MIMO decoding been proved hard from lattice problems? — arXiv:2609.05013

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05013
License (as archived)
CC0-1.0
Archived
2026-10-16T22:51:19.107Z
SHA-256 of the archived text
3f6e955903f23706f7fc58e77ca91b53c7db2fbbd7e52126bec5b60c12980d53
Stable URL of this page
https://metraipolis.com/documento/dc_76914dc1bdb2

How to cite

Has MIMO decoding been proved hard from lattice problems? — arXiv:2609.05013 — arXiv (en), https://arxiv.org/abs/2609.05013 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_76914dc1bdb2 (Metraipolis archive dc_76914dc1bdb2, sha256 3f6e955903f23706f7fc58e77ca91b53c7db2fbbd7e52126bec5b60c12980d53)
BibTeX
@misc{dc76914dc1bdb2,
  title = {Has MIMO decoding been proved hard from lattice problems? — arXiv:2609.05013},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05013},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_76914dc1bdb2; sha256 3f6e955903f23706f7fc58e77ca91b53c7db2fbbd7e52126bec5b60c12980d53},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05013. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multiple-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). If valid, this reduction would give physical layer security a strong computational foundation based on the hardness of established lattice problems. Subsequent works presented attacks and counterexamples against the resulting construction, casting doubt on its security but leaving the precise validity and limitations of the underlying reduction incompletely understood. We provide a theoretical examination of the revised reduction and identify the structural features of the LWE reduction that fail to carry over to the non-modular MIMO setting, hence showing that its published proof does not establish the claimed hardness of MIMO decoding. Our results distinguish flaws in the hardness proof from direct attacks on particular parameter choices and clarify what would be required of any attempted repair. We do not rule out physical layer security for MIMO systems in general, but show that the claimed lattice hardness guarantee does not follow from the existing reduction.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-07 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.05013 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T22:30:54.315Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).