This paper concerns an exhaustive search for normal bases with minimum complexity in finite fields F2n over F2 for n≤46. This is a followup paper to [11], which appeared one decade ago in 2008 and completed the cases n≤39. We extend the results in [11] by taking advantage of a combination of algorithmic improvements, more efficient implementations and massive parallelism.

Additional Metadata
Keywords Finite fields, Normal bases, NTL, Parallel computing
Persistent URL
Series Lecture Notes in Computer Science
Moura, L. (L.), Panario, D, & Thomson, D. (2018). Normal basis exhaustive search: 10 years later. In Lecture Notes in Computer Science. doi:10.1007/978-3-030-05153-2_10