Hi everyone... This is an implementation of a thing called galois fields of size p^q where p is a prime number... There is a (faster) implementation only for GF(2^q) fields since they are more used than the other in computer science Nothing to say about it... other maybe than algebra is just math best field (u get it). There are 2 main issus with this implementation : you can only have fields based on at most Z/94Z (so Z/89Z) and there is no built-in way to compute the multiplicative inverse of a given element... For the inverse problem there is a way : compute all multiplication inside the field and then find the one that works (you should build a fixed table if you want to do this) BUT this is (quite) expensive since it is around (p^q)^2 operations (since the field has p^q elements).. idk any other way of doing it... Credits : - all by me @morveman (and maybe a bit from mathematiciens i suppose) [don't mind this...] #math #field #ring #group #theory #extention #GF #prime #number #?
