Quasi-twisted codes: decoding and applications in code-based cryptography
Cryptography and Security
2025-07-03 v1 Information Theory
math.IT
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.
Cite
@article{arxiv.2507.01118,
title = {Quasi-twisted codes: decoding and applications in code-based cryptography},
author = {Bhagyalekshmy S and Rutuja Kshirsagar},
journal= {arXiv preprint arXiv:2507.01118},
year = {2025}
}