/
finitefield.py
256 lines (183 loc) · 7.18 KB
/
finitefield.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
"""Implementation of :class:`FiniteField` class."""
from __future__ import annotations
import numbers
import random
from ..core import Dummy, integer_digits
from ..ntheory import factorint, is_primitive_root, isprime
from ..polys.polyerrors import CoercionFailed
from .field import Field
from .groundtypes import DiofantInteger
from .integerring import GMPYIntegerRing, PythonIntegerRing, ZZ_python
from .quotientring import QuotientRingElement
from .ring import CommutativeRing
from .simpledomain import SimpleDomain
class IntegerModRing(CommutativeRing, SimpleDomain):
"""General class for quotient rings over integers."""
is_Numerical = True
def __new__(cls, order, dom):
if isprime(order):
return dom.finite_field(order)
mod = dom.convert(order)
key = cls, order, dom
obj = super().__new__(cls)
obj.domain = dom
obj.mod = mod
obj.order = order
obj.rep = f'IntegerModRing({obj.order})'
try:
obj.dtype = _modular_integer_cache[key]
except KeyError:
obj.dtype = type('ModularInteger', (ModularInteger,),
{'mod': mod, 'domain': dom, '_parent': obj})
_modular_integer_cache[key] = obj.dtype
obj.zero = obj.dtype(0)
obj.one = obj.dtype(1)
return obj
def __hash__(self):
return hash((self.__class__.__name__, self.dtype, self.order, self.domain))
def __eq__(self, other):
return isinstance(other, self.__class__) and \
self.order == other.order and self.domain == other.domain
def __getnewargs_ex__(self):
return (self.order,), {}
@property
def characteristic(self):
return self.order
def to_expr(self, element):
return DiofantInteger(int(element))
def from_expr(self, expr):
if expr.is_Integer:
return self.dtype(self.domain.dtype(int(expr)))
elif expr.is_Float and int(expr) == expr:
return self.dtype(self.domain.dtype(int(expr)))
else:
raise CoercionFailed(f'expected an integer, got {expr}')
def _from_PythonFiniteField(self, a, K0=None):
return self.dtype(self.domain.convert(a.rep, K0.domain))
_from_GMPYFiniteField = _from_PythonFiniteField
def _from_PythonIntegerRing(self, a, K0=None):
return self.dtype(self.domain.convert(a, K0) % self.characteristic)
_from_GMPYIntegerRing = _from_PythonIntegerRing
def _from_PythonRationalField(self, a, K0=None):
if a.denominator == 1:
return self.convert(a.numerator)
_from_GMPYRationalField = _from_PythonRationalField
def _from_RealField(self, a, K0):
p, q = K0.to_rational(a)
if q == 1:
return self.dtype(self.domain.dtype(p))
def is_normal(self, a):
return True
class FiniteField(Field, IntegerModRing):
"""General class for finite fields."""
is_FiniteField = True
def __new__(cls, order, dom, modulus=None):
try:
pp = factorint(order)
if not order or len(pp) != 1:
raise ValueError
mod, deg = pp.popitem()
except ValueError:
raise ValueError(f'order must be a prime power, got {order}')
if deg == 1:
if modulus:
deg = len(modulus) - 1
else:
modulus = [0, 1]
order = mod**deg
if modulus is None:
random.seed(0)
ring = ZZ_python.finite_field(mod).inject(Dummy('x'))
modulus = ring._gf_random(deg, irreducible=True).all_coeffs()
elif deg != len(modulus) - 1:
raise ValueError('degree of a defining polynomial for the field'
' does not match extension degree')
modulus = tuple(map(dom.dtype, modulus))
mod = dom.convert(mod)
key = cls, order, dom, mod, modulus
obj = super(IntegerModRing, cls).__new__(cls) # pylint: disable=bad-super-call
obj.domain = dom
obj.mod = mod
obj.order = order
if order > mod:
obj.rep = f'GF({obj.mod}, {list(map(ZZ_python, modulus))})'
else:
obj.rep = f'GF({obj.mod})'
try:
obj.dtype = _modular_integer_cache[key]
except KeyError:
if deg == 1:
obj.dtype = type('ModularInteger', (ModularInteger,),
{'mod': mod, 'domain': dom, '_parent': obj})
else:
ff = dom.finite_field(mod).inject(Dummy('x'))
mod = ff.from_list(modulus)
if not mod.is_irreducible:
raise ValueError('defining polynomial must be irreducible')
obj.dtype = type('GaloisFieldElement', (GaloisFieldElement,),
{'mod': mod, 'domain': ff, '_parent': obj})
_modular_integer_cache[key] = obj.dtype
obj.zero = obj.dtype(0)
obj.one = obj.dtype(1)
return obj
@property
def characteristic(self):
return self.mod
_modular_integer_cache: dict[tuple, IntegerModRing] = {}
class PythonIntegerModRing(IntegerModRing):
"""Quotient ring based on Python's integers."""
def __new__(cls, order):
return super().__new__(cls, order, PythonIntegerRing())
class GMPYIntegerModRing(IntegerModRing):
"""Quotient ring based on GMPY's integers."""
def __new__(cls, order):
return super().__new__(cls, order, GMPYIntegerRing())
class PythonFiniteField(FiniteField):
"""Finite field based on Python's integers."""
def __new__(cls, order, modulus=None):
return super().__new__(cls, order, PythonIntegerRing(), modulus)
class GMPYFiniteField(FiniteField):
"""Finite field based on GMPY's integers."""
def __new__(cls, order, modulus=None):
return super().__new__(cls, order, GMPYIntegerRing(), modulus)
class ModularInteger(QuotientRingElement):
"""A class representing a modular integer."""
@property
def numerator(self):
return self
@property
def denominator(self):
return self.parent.one
@property
def is_primitive(self):
"""Test if this is a primitive element."""
parent = self.parent
return is_primitive_root(int(self), parent.order)
class GaloisFieldElement(ModularInteger):
"""A class representing a Galois field element."""
def __init__(self, rep):
if isinstance(rep, numbers.Integral):
rep = list(reversed(integer_digits(rep % self.parent.order, self.parent.mod)))
if isinstance(rep, (list, tuple)):
rep = self.domain.from_list(rep)
super().__init__(rep)
def __int__(self):
rep = self.rep.set_domain(self.parent.domain)
return int(rep(self.parent.mod))
@property
def is_primitive(self):
parent = self.parent
p = parent.characteristic
f = self.rep
domain = self.domain
x = domain.gens[0]
n = f.degree()
if not (f.is_irreducible and n):
return False
t = x**n
for _ in range(n, p**n - 1):
r = t % f
if r == 1:
return False
t = r*x
return True