Galois Finite Field Implementation in Python 3
Project description
Galois Field (GF) is a field contains a finite number of elements. There are 2 types of Galois Field:
- Prime Field (m = 1)
- Extension Field (m != 1)
In prime field, elements are integer within [0, p-1] range. Prime field have a prime p that limits our value so it will always be within the field.
In extension field, elements can be polynomials with maximum degree of (m-1). Extension field have a prime p and prime polynomial (irreducible) that limits our polynomial and its values so it will always be within the field.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
GaloisField-0.1.1.tar.gz
(7.9 kB
view hashes)
Built Distribution
Close
Hashes for GaloisField-0.1.1-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 22c518668b569e3da11160ce3c90db2b8ffb4f1e1b5e50bacd643401567ae96e |
|
| MD5 | 67198efd84df929e6582ff2d025553b2 |
|
| BLAKE2b-256 | 135b2072f6ad9f3353b18af8905231f0d33b1b54b6c317ac7fab37f2d20240f9 |
