Cryptography, Blockchain, Ethereum, Loopring, Learning.
fields = GF(2^m) where m > 1 These polynomials take the form of: To make it less cryptic, let’s use the example of GF(2^3) which will result in the equation form: GF(2^3) = GF(8) which means there’ll be a total of 8 elements in this set. If we write out the elements they’ll have the following