Subquadratic Space Complexity Multiplier for GF(2(n)) Using Type 4 Gaussian Normal Bases

作者：Park Sun Mi; Hong Dowon^*; Seo Changho

来源：ETRI Journal, 2013, 35(3): 523-529.

DOI：10.4218/etrij.13.0112.0596

• Finite field arithmetic
• subquadratic space complexity multiplier
• normal basis
• Gaussian normal basis

Subquadratic space complexity multipliers for optimal normal bases (ONBs) have been proposed for practical applications. However, for the Gaussian normal basis (GNB) of type t > 2 as well as the normal basis (NB), there is no known subquadratic space complexity multiplier. In this paper, we propose the first subquadratic space complexity multipliers for the type 4 GNB. The idea is based on the fact that the finite field GF(2(n)) with the type 4 GNB can be embedded into fields with an ONB.

• 出版日期2013-6