Score: 0

On Codes from Split Metacyclic Groups

Published: April 16, 2025 | arXiv ID: 2504.11960v1

By: Kirill Vedenev

Potential Business Impact:

Finds new ways to break secret codes.

Business Areas:
QR Codes Software

The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime to the group order. Utilizing this decomposition, we develop a systematic theory of metacyclic codes, providing their algebraic description and proving that they can be viewed as generalized concatenated codes with cyclic inner codes and skew quasi-cyclic outer codes. We establish bounds on the minimum distance of metacyclic codes and investigate the class of induced codes. Furthermore, we show the feasibility of constructing a partial key-recovery attack against certain McEliece-type cryptosystems based on metacyclic codes by exploiting their generalized concatenated structure.

Page Count
16 pages

Category
Computer Science:
Information Theory