Metraipolis › archive › dc_01ac88446458

Symmetric Models for Syndrome Decoding — arXiv:2609.14052

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.14052
License (as archived): CC0-1.0
Archived: 2026-10-15T23:53:47.052Z
SHA-256 of the archived text: bc7f6c93715baf810490c496cedef07ebe28f6e8e33dbd6ab8594f1ef223df1e
Stable URL of this page: https://metraipolis.com/documento/dc_01ac88446458

How to cite

Symmetric Models for Syndrome Decoding — arXiv:2609.14052 — arXiv (en), https://arxiv.org/abs/2609.14052 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_01ac88446458 (Metraipolis archive dc_01ac88446458, sha256 bc7f6c93715baf810490c496cedef07ebe28f6e8e33dbd6ab8594f1ef223df1e)

BibTeX

@misc{dc01ac88446458,
  title = {Symmetric Models for Syndrome Decoding — arXiv:2609.14052},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14052},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_01ac88446458; sha256 bc7f6c93715baf810490c496cedef07ebe28f6e8e33dbd6ab8594f1ef223df1e},
  year = {2026}
}

Archived text

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

This paper introduces a new polynomial model for the exact variant of the Syndrome Decoding Problem (SDP) in the binary case. The model is based on elementary symmetric polynomials. We estimate the computational complexity of solving the corresponding polynomial system by establishing bounds on the degree of regularity and on the solving degree of the ideal associated to the model. The complexity estimate is lower than for previous polynomial models. We also provide a variant of the model whose complexity depends directly on the specific instance of the SDP and is lower than for the first model. Finally, we discuss how to apply our approach to solve other variants of the SDP.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-15 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Commutative Algebra (math.AC).
Pagina del lavoro: https://arxiv.org/abs/2609.14052 — 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-15T23:20:42.646Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).