modp.py 2.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980
  1. from .euclidean import *
  2. from .numbertype import *
  3. # so all IntegersModP are instances of the same base class
  4. class _Modular(FieldElement):
  5. pass
  6. @memoize
  7. def IntegersModP(p):
  8. # assume p is prime
  9. class IntegerModP(_Modular):
  10. def __init__(self, n):
  11. try:
  12. self.n = int(n) % IntegerModP.p
  13. except:
  14. raise TypeError("Can't cast type %s to %s in __init__" % (type(n).__name__, type(self).__name__))
  15. self.field = IntegerModP
  16. @typecheck
  17. def __add__(self, other):
  18. return IntegerModP(self.n + other.n)
  19. @typecheck
  20. def __sub__(self, other):
  21. return IntegerModP(self.n - other.n)
  22. @typecheck
  23. def __mul__(self, other):
  24. return IntegerModP(self.n * other.n)
  25. def __neg__(self):
  26. return IntegerModP(-self.n)
  27. @typecheck
  28. def __eq__(self, other):
  29. return isinstance(other, IntegerModP) and self.n == other.n
  30. @typecheck
  31. def __ne__(self, other):
  32. return isinstance(other, IntegerModP) is False or self.n != other.n
  33. @typecheck
  34. def __divmod__(self, divisor):
  35. q,r = divmod(self.n, divisor.n)
  36. return (IntegerModP(q), IntegerModP(r))
  37. def inverse(self):
  38. # need to use the division algorithm *as integers* because we're
  39. # doing it on the modulus itself (which would otherwise be zero)
  40. x,y,d = extendedEuclideanAlgorithm(self.n, self.p)
  41. if d != 1:
  42. raise Exception("Error: p is not prime in %s!" % (self.__name__))
  43. return IntegerModP(x)
  44. def __abs__(self):
  45. return abs(self.n)
  46. def __str__(self):
  47. return str(self.n)
  48. def __repr__(self):
  49. return '%d (mod %d)' % (self.n, self.p)
  50. def __int__(self):
  51. return self.n
  52. IntegerModP.p = p
  53. IntegerModP.__name__ = 'Z/%d' % (p)
  54. IntegerModP.englishName = 'IntegersMod%d' % (p)
  55. return IntegerModP
  56. if __name__ == "__main__":
  57. mod7 = IntegersModP(7)