Open AccessSubquadratic Space Complexity Multiplier for GF (2 n ) Using Type 4 Gaussian Normal Bases
Author(s) -
Park SunMi,
Hong Dowon,
Seo Changho
Publication year - 2013
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.13.0112.0596
Subject(s) - multiplier (economics) , mathematics , gaussian , finite field , discrete mathematics , space (punctuation) , type (biology) , combinatorics , computer science , physics , quantum mechanics , ecology , biology , economics , macroeconomics , operating system
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.