Abstract
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.
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
