Hello As i understand it, polynomial support was added to OpenSSL by Suns ECC library It looks like both polynomials and GF(p) elements are represented by Bignum structs.
While functions in crypto/bn/bn_gf2m.c seem to provide basic binary field arithmetics, I cant help but wonder, is there a way to generate a prime (irreducible) polynomial or check if it is one? Thanks
