Mathematics – Number Theory
Scientific paper
2010-07-28
Finite Fields and their Applications, Vol 18, Issue 2, 2012, pp 458-472
Mathematics
Number Theory
Scientific paper
10.1016/j.ffa.2011.10.002
Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis.
Arnault François
Pickett Erik Jarl
Vinatier Stéphane
No associations
LandOfFree
Construction of self-dual normal bases and their complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Construction of self-dual normal bases and their complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of self-dual normal bases and their complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-73706