Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases (2007)
by
H. Fan
,
M. A. Hasan
| Citations: | 5 - 2 self |
BibTeX
@MISC{Fan07subquadraticcomputational,
author = {H. Fan and M. A. Hasan},
title = {Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases. basis. Index Terms Finite field, subquadratic computational complexity multiplication, normal basis, optimal normal
