pyecsca.ec.mod module

pyecsca.ec.mod.gcd(a, b)[source]

Euclid’s greatest common denominator algorithm.

pyecsca.ec.mod.extgcd(a, b)[source]

Extended Euclid’s greatest common denominator algorithm.

class pyecsca.ec.mod.Mod(x, n)[source]

Bases: object

An element x of ℤₙ.

inverse()[source]
class pyecsca.ec.mod.Undefined[source]

Bases: pyecsca.ec.mod.Mod