Cameron/Galois
1
0
Fork 0
mirror of https://github.com/Ikatono/Galois.git synced 2025-10-29 04:45:31 -05:00
Code Issues Projects Releases Wiki Activity

continued work on field class

Browse Source
This commit is contained in:
Cameron
2018-02-22 18:58:58 -05:00
parent d140538798
commit 34c3ae576e
1 changed files with 14 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
GF.py
View File

@@ -42,6 +42,11 @@ class GF:
self.poly.append((int(i),1)) self.poly.append((int(i),1))
if p == 2: if p == 2:
self.poly.append((0,1)) self.poly.append((0,1))
#performs a modulus operation using self.poly
def mod(self, other):
#copy the provided list
other = list(other)
#creates a new element with the given value #creates a new element with the given value
@@ -54,11 +59,18 @@ class GF:
if isisntance(val, int): if isisntance(val, int):
if self.characteristic != 2: if self.characteristic != 2:
raise TypeError('integer definition of field elements is only allowed in fields of characteristic 2') raise TypeError('integer definition of field elements is only allowed in fields of characteristic 2')
#TODO cover binary conversion
#covers the case that the value is an iterable of individual terms #covers the case that the value is an iterable of individual terms
#first term is for exponent zero, etc. #first term is for exponent zero, etc.
#accepts integers or strings #accepts integers or strings
else: else:
pol = [0] * self.degree #makes val into a list in order to check the number of terms
if isinstance(val, str):
#strings are interpreted as the first character being most significant
val = [i for i in val[::-1]]
else:
val = list(val)
pol = [0] * len(val)
for i in range(len(val)): for i in range(len(val)):
if isinstance(val[i], int): if isinstance(val[i], int):
pol[i] = val[i] pol[i] = val[i]
@@ -75,6 +87,7 @@ class GF:
pol[i] = a - 87 pol[i] = a - 87
else: else:
raise ValueError('polynomial coefficient is uninterprettable') raise ValueError('polynomial coefficient is uninterprettable')
pol = self.mod(pol)