Normal bases on Galois ring extensions (Q2337860)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7133843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Normal bases on Galois ring extensions |
scientific article; zbMATH DE number 7133843 |
Statements
Normal bases on Galois ring extensions (English)
0 references
20 November 2019
0 references
Summary: Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension \(\mathbf{R}/Z_{p^r}\), where \(\mathbf{R} =GR(p^r, n)\). We present a criterion on the normal basis for \(\mathbf{R}/Z_{p^r}\) and reduce this problem to one of finite field extension \(\overline{\mathbf{R}}/\overline{Z}_{p^r} = \mathbb{F}_q /\mathbb{F}_p(q = p^n)\) by Theorem 1. We determine all optimal normal bases for Galois ring extension.
0 references
Galois ring
0 references
optimal normal basis
0 references
multiplicative complexity
0 references
finite field
0 references
0 references
0 references
0.8487221598625183
0 references
0.8211212754249573
0 references
0.8211212754249573
0 references
0.8040429949760437
0 references
0.7923358082771301
0 references