A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials
Özet
In this paper, Hermite polynomial representation is proposed as an alternative way to represent finite fields of characteristic two. We show that multiplication in Hermite polynomial representation can be achieved with subquadratic space complexity. This representation enables us to find binomial or trinomial irreducible polynomials which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. We then show that the product of two elements in Hermite polynomial representation can be performed as Toeplitz matrix-vector product. This representation is very interesting for NIST recommended binary field GF(2(571)) since there is no ONB for the corresponding extension. This representation can be used to obtain more efficient finite field arithmetic.
