Add calculates z = x+y mod p.

AddSub calculates (x,y) = (x+y mod p, x-y mod p).

Cmov assigns y to x if n is 1.

Cswap interchanges x and y if n is 1.

Inv calculates z = 1/x mod p.

InvSqrt calculates z = sqrt(x/y) iff x/y is a quadratic-residue.

IsOne returns true if x is equal to 1.

IsZero returns true if x is equal to 0.

Modp ensures that z is between [0,p-1].

Mul calculates z = x*y mod p.

Neg calculates z = -x.

One returns the 1 element.

P returns the prime modulus 2^448-2^224-1.

SetOne assigns x=1.

Sqr calculates z = x^2 mod p.

Sub calculates z = x-y mod p.

ToBytes stores in b the little-endian byte representation of x.

Size in bytes of an element.

Elt is a prime field element.