Abstract
In 1978, Robert McEliece constructed the first asymmetric code-based cryptosystem using noise-immune Goppa codes; no effective key attacks has been described for it yet. By now, quite a lot of code-based cryptosystems are known; however, their cryptographic security is inferior to that of the classical McEliece cryptosystem. In connection with the development of quantum computing, code-based cryptosystems are considered as an alternative to number theoretical ones; therefore, the problem of seeking promising classes of codes to construct new secure code-based cryptosystems is relevant. For this purpose, noncommutative codes can be used, that is, ideals in group algebras $${{\mathbb{F}}_{q}}G$$ over finite noncommutative groups $$G$$. The security of cryptosystems based on codes induced by subgroup codes has been studied earlier. The Artin–Wedderburn theorem, which proves the existence of an isomorphism of a group algebra to the direct sum of matrix algebras, is important for studying noncommutative codes. However, the particular form of terms and the construction of the isomorphism are not specified by this theorem; thus, for each group, there remains the problem of constructing the Wedderburn representation. The complete Wedderburn decomposition for the group algebra $${{\mathbb{F}}_{q}}{{D}_{{2n}}}$$ over the dihedral group $${{D}_{{2n}}}$$ has been obtained by F.E. Brochero Martinez in the case when the cardinality of the field and the order of the group are relatively prime numbers. Using these results, we study codes in the group algebra $${{\mathbb{F}}_{q}}{{D}_{{2n}}}$$ in this paper. The problem on the structure of all codes is solved, and the structure of codes induced by codes over cyclic subgroups of $${{D}_{{2n}}}$$ is described, which is of interest for cryptographic applications.
Highlights
Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes
less secure. Code cryptosystems are considered an alternate to number-theoretical ones in connection
M., "Codes in Dihedral Group Algebra", Modeling and Analysis of Information Systems, 25:2 (2018), 232–245
Summary
Диэдральной группой D2n, где n ≥ 2, называется группа симметрий правильного плоского n-угольника с центром в точке O, состоящая из поворотов вокруг точки. Аналогично определено вложение поля Fq в FqG, переводящее λ ∈ Fq в λe ∈ FqG, где e ∈ G – нейтральный элемент группы. Всякий левый идеал I ⊂ FqG называется групповым G-кодом над полем Fq Что многочлен g самовозвратный, если g и g∗ имеют одни и те же корни в своём поле разложения, т. Что многочлен xn − 1 ∈ Fq[x] разлагается на неприводимые над Fq множители; следуя [7], запишем это разложение следующим образом: xn − 1 = Всякий неприводимый над полем Fq многочлен h степени m имеет корень в расширении этого поля Fqm, обозначим его через α, при этом элементы α0 = 1, α1, α2, . Βn−1, где β = α−1 корень многочлена h∗, тоже образуют базис в Fqn, поэтому.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
