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

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

Full description

Saved in:
Bibliographic Details
Published in:ETRI journal 2013, 35(3), , pp.523-529
Main Authors: Park, Sun‐Mi, Hong, Dowon, Seo, Changho
Format: Article
Language:English
Subjects:
Finite field arithmetic
Gaussian normal basis
normal basis
subquadratic space complexity multiplier
전자/정보통신공학
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(2n) with the type 4 GNB can be embedded into fields with an ONB.
ISSN:1225-6463
2233-7326
DOI:10.4218/etrij.13.0112.0596