The structure of finite group algebra of a semidirect product of abelian groups and its applications
https://doi.org/10.22405/2226-8383-2019-20-3-107-123
Abstract
In 1978 R. McEliece developed the first assymetric cryptosystem based on the use of Goppa's error-correctring codes and no effective key attacks has been described yet. Now there are many code-based cryptosystems known. One way to build them is to modify the McEliece cryptosystem by replacing Goppa's codes with other codes. But many variants of this modification were proven to be less secure.
In connection with the development of quantum computing code cryptosystems along with lattice-based cryptosystems are considered as an alternative to number-theoretical ones. Therefore, it is relevant to find promising classes of codes that are applicable in cryptography. It seems that for this non-commutative group codes, i.e. left ideals in finite non-commutative group algebras, could be used.
The Wedderburn theorem is useful to study non-commutative group codes. It implies the existence of an isomorphism of a semisimple group algebra onto a direct sum of matrix algebras. However, the specific form of the summands and the isomorphism construction are not explicitly defined by this theorem. Hence for each semisimple group algebra there is a task to explicitly construct its Wedderburn decomposition. This decomposition allows us to easily describe all left ideals of group algebra, i.e. group codes.
In this paper we consider one semidirect product $$Q_{m,n} = (\mathbb{Z}_m \times \mathbb{Z}_n) \leftthreetimes (\mathbb{Z}_2 \times \mathbb{Z}_2)$$ of abelian groups and the group algebra $$\mathbb{F}_q Q_{m,n}$$. In the case when $$n \mid q -1$$ and $$\gcd(2mn, q) = 1,$$ the Wedderburn decomposition of this algebra is constructed. In the case when field is of characteristic $$2,$$ i.e. when this group algebra is not semisimple, a similar structure theorem is also obtained. Further in the paper, the primitive central idempotents of this group algebra are described. The obtained results are used to algebraically describe the group codes over $$Q_{m,n}.$$
About the Authors
Kirill Vladimirovich Vedenev
Southern Federal University (Rostov-on-Don)
Russian Federation
Russian Federation
Vladimir Mikhailovich Deundyak
Russian Federation
candidate of physical and mathematical Sciences, associate Professor, Southern Federal University, Research Institute ”Specvuzavtomatika” (Rostov-on-Don).
References
1. Milies, C.P. & Sehgal, S. K. 2002, An inroduction to Group Rings, Kluwer Academic Publishers, Boston.
2. Lang, S., 2002, Algebra, Springer-Verlag, New York.
3. Kelarev, A. V. & Sol´e, P. 2001, ”Error correcting codes as ideals in group rings”, Contemp. Math., vol. 273, pp. 11–18.
4. Kouselo, E., Gonsales, S., Markov, V. T., Martines, K. & Nechaev, A.A. 2012, ”Ideal representations of Reed-Solomon and Reed-Muller codes”, Algebra Logic, vol. 51, no. 3, pp. 195–212.
5. Berman, S. D. 1967, ”On the theory of group codes”, Cybernetics, vol. 3, pp. 25–31.
6. Charpin, P. 1983, ”The Extended Reed-Solomon Codes Considered as Ideals or a Modular Algebra” North-Holland Mathematics Studies, vol. 75, pp. 171–176.
7. Tumaykin, I. N. 2018, ”Group Ring Ideals Related to Reed–Muller Codes”, J Math Sci, vol. 233, pp. 745–748.
8. Zimmermann, K.H. 1994, Beitrage zur algebraischen Codierungstheorie mittels modularer Darstellungstheorie, Bayreuther Mathematische Schriften Vol. 48, University of Bayreuth.
9. Assuena, S. & Milies, C.P 2019, ”Good codes from metacyclic groups”, Contemp. Math., vol. 727, pp. 39–49.
10. Olteanu, G. & Van Gelder, I. 2015, ”Construction of minimal non-abelian left group codes”, Des. Codes Cryptogr., vol. 75, no. 3, pp. 359–373.
11. Vedenev, K. V. & Deundyak, V.M 2018, ”Codes in Dihedral Group Algebra” (in Russian), Modeling and Analysis of Information Systems, vol. 25, no. 2, pp. 232–245.
12. https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Post-Quantum-Cryptography-Standardization Last visited 1.07.2019.
13. Minder, L. & Shokrollahi, A. 2007, ”Cryptanalysis of the Sidelnikov cryptosystem”, Lecture Notes in Computer Science, vol. 4515, pp. 347–360.
14. Chizhov, I. I. & Borodin, M. A. 2014, ”Effective attack on the McEliece cryptosystem based on Reed-Muller codes”, Discrete Mathematics and Applications, vol. 24, issue 5, pp. 273–280.
15. Sidelnikov, V. M., & Shestakov, S. O. 1992, ”On an encoding system constructed on the basis of generalized Reed–Solomon codes”,Discrete Mathematics and Applications, vol. 2, issue 4, pp. 439–444.
16. Broche, O. & Del RiO, A. 2007, ”Wedderburn decomposition of finite group algebras”, Finite Fields and Their Applications, vol. 13(1), pp. 71–79.
17. Bakshi, G. K., Gupta, S., & Passi, I. B. S. 2013, ”The structure of finite semisimple metacyclic group algebras”, J. Ramanujan Math. Soc, vol. 28(2), pp. 141–158.
18. Martinez, F. B. 2015, ”Structure of finite dihedral group algebra”, Finite Fields and Their Applications, vol. 35, pp. 204–214.
19. Coxeter, H. S., & Moser, W. O. 2013, Generators and relations for discrete groups, Springer Science & Business Media.
20. Magnus, W., Karrass, A., & Solitar, D. 2004, Combinatorial group theory: Presentations of groups in terms of generators and relations, Courier Corporation.
21. Jacobson, N. 1956, Structure of rings, Vol. 37, American Mathematical Soc.
Review
For citations:
Vedenev K.V., Deundyak V.M. The structure of finite group algebra of a semidirect product of abelian groups and its applications. Chebyshevskii Sbornik. 2019;20(3):107-123. (In Russ.) https://doi.org/10.22405/2226-8383-2019-20-3-107-123
Views:
596
Email this article 