{"ID":2899788,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.01118","arxiv_id":"2507.01118","title":"Quasi-twisted codes: decoding and applications in code-based cryptography","abstract":"Quasi-twisted (QT) codes generalize several important families of linear codes, including cyclic, constacyclic, and quasi-cyclic codes. Despite their potential, to the best of our knowledge, there exists no efficient decoding algorithm for QT codes. In this work, we propose a syndrome-based decoding method capable of efficiently correcting up to (d* - 1)/2 errors, where d* denotes an HT-like lower bound on the minimum distance of QT codes, which we formalize here. Additionally, we introduce a Niederreiter-like cryptosystem constructed from QT codes. This cryptosystem is resistant to some classical attacks as well as some quantum attacks based on Quantum Fourier Sampling.","short_abstract":"Quasi-twisted (QT) codes generalize several important families of linear codes, including cyclic, constacyclic, and quasi-cyclic codes. Despite their potential, to the best of our knowledge, there exists no efficient decoding algorithm for QT codes. In this work, we propose a syndrome-based decoding method capable of e...","url_abs":"https://arxiv.org/abs/2507.01118","url_pdf":"https://arxiv.org/pdf/2507.01118v1","authors":"[\"Bhagyalekshmy S\",\"Rutuja Kshirsagar\"]","published":"2025-07-01T18:26:27Z","proceeding":"cs.CR","tasks":"[\"cs.CR\",\"cs.IT\"]","methods":"[]","has_code":false}