When working with finite fields, if the number of elements is a prime power with m > 1, you can represent the elements as polynomials with degree m-1 and do the field addition and multiplication modulo a irreducible polynomial with degree m. The field GF(5) is composed by the numbers 0 to 4. We don’t [...]
-
About
Brain dumps on programming, cryptography, and computer related stuff.
-
Search
-
Categories