:: Converts a non-negative integer into an element of GF(2^n).
return
element of GF(2^n)
m
non-negative integer
Let m be a non-negative integer.
m has the binary representation
m=m0+m1*2+...+mk*2^k.
This function returns an element of GF(2^n) = GF(2)[t]/(g(t)),
m0+m1*t+...+mk*t^k mod g(t).