gf_mult
Galois Field Arithmetic  tools
Install
 All systems

curl cmd.cat/gf_mult.sh
 Debian

aptget install gfcompletetools
 Ubuntu

aptget install gfcompletetools
 Kali Linux

aptget install gfcompletetools
 Windows (WSL2)

sudo aptget update
sudo aptget install gfcompletetools
 Raspbian

aptget install gfcompletetools
 Dockerfile
 dockerfile.run/gf_mult
gfcompletetools
Galois Field Arithmetic  tools
Galois Field arithmetic forms the backbone of erasurecoded storage systems, most famously the ReedSolomon erasure code. A Galois Field is defined over wbit words and is termed GF(2w). As such, the elements of a Galois Field are the integers 0, 1, . . ., 2^w − 1. Galois Field arithmetic defines addition and multiplication over these closed sets of integers in such a way that they work as you would hope they would work. Specifically, every number has a unique multiplicative inverse. Moreover, there is a value, typically the value 2, which has the property that you can enumerate all of the nonzero elements of the field by taking that value to successively higher powers. This package contains miscellaneous tools for working with gfcomplete.