Abstract

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 R/Zpr, where R=GR(pr,n). We present a criterion on the normal basis for R/Zpr and reduce this problem to one of finite field extension R¯/Z¯pr=Fq/Fp(q=pn) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

Details

Title
Normal Bases on Galois Ring Extensions
Author
Zhang, Aixian 1 ; Feng, Keqin 2 

 Department of Mathematical Sciences, Xi’an University of Technology, Xi’an 710048, China 
 Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China 
First page
702
Publication year
2018
Publication date
2018
Publisher
MDPI AG
e-ISSN
20738994
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2582921241
Copyright
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.