Codes in dihedral group algebra

K. V. Vedenev ; V. M. Deundyak

Modelirovanie i analiz informacionnyh sistem, Tome 25 (2018) no. 2, pp. 232-245.

Résumé

Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet. Variants of this cryptosystem are known due to the use of different codes types, but most of them were proven to be less secure. Code cryptosystems are considered an alternate to number-theoretical ones in connection with the development of quantum computing. So, the new classes of error-correcting codes are required for building new resistant code cryptosystems. Non-commutative codes, which simply are ideals of finite non-commutative group algebras, are an option. The Artin-Wedderburn theorem implies that a group algebra is isomorphic to a finite direct sum of matrix algebras, when the order of the group and the field characteristics are relatively prime. This theorem is important to study the structure of a non-commutative code, but it gives no information about summands and the isomorphism. In case of a dihedral group these summands and the isomorphism were found by F. E. Brochero Martinez. The purpose of the paper is to study codes in dihedral group algebras as and when the order of a group and a field characteristics are relatively prime. Using the result of F. E. Brochero Martinez, we consider a structure of all dihedral codes in this case and the codes induced by cyclic subgroup codes.

Détail

Keywords: non-commutative groups, group algebra, code cryptosystems.
Mots-clés : non-commutative codes

Bibliographie

[1] McEliece R.J., “A Public-Key Cryptosystem Based on Algebraic Coding Theory”, DSN Progress Report, 42–44 (1978), 114-116

[2] Deundyak V. M., Kosolapov Y. V., “Cryptosystem Based on Induced Group Codes”, Modeling and Analysis of Information Systems, 23:2 (2016), 137–152 (in Russian) | MR

[3] Deundyak V. M., Kosolapov Y. V., Lelyuk E. A., “Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems”, Modeling and Analysis of Information Systems, 24:2 (2017), 239–252 (in Russian)

[4] Deundyak V. M., Kosolapov Y. V., “The use of the tensor product of Reed–Muller codes in asymmetric McEliece type cryptosystem and analysis of its resistance to attacks on the cryptogram”, Computational Technologies, 22:4 (2017), 43–60 (in Russian) | MR

[5] Milies C. P., Sehgal S. K., An inroduction to Group Rings, Kluwer Academic Publishers, Boston, 2002 | MR

[6] Sidel'nikov V. M., Kazarin L. S., “On a group algebra of a dihedral group and complexity of multiplication of second order matrices”, Tr. Diskr. Mat., 11, no. 1, Fizmatlit, M., 2008, 109–118 (in Russian)

[7] Martinez F. E. B., “Structure of finite dihedral group algebra”, Finite Fields and Their Applications, 35 (2015), 204–214 | DOI | MR

[8] E. B. Vinberg, Course in Algebra, M., 2013 (in Russian)

[9] Tsimmerman K.-Kh., Metody teorii modulyarnykh predstavleniy v algebraicheskoy teorii kodirovaniya, M., 2011 (in Russian)

[10] Deundyak V. M., Kosolapov Y. V., “Algorithms for Majority Decoding of Group Codes”, Modeling and Analysis of Information Systems, 22:4 (2015), 464–482 (in Russian) | MR

[11] Jacobson N., Structure of rings, American Mathematical Soc., 1956 | MR

[12] Sidelnikov V. M., Teoriya kodirovaniya, Fizmatlit, M., 2011 (in Russian)