Bitcoin.Crypto.FiniteField.Naive.Fn

The finite field Fn of n elements, where n is the order of the elliptic curve secp256k1 (which happens to be a prime).

Naive implementation.

Documentation

secp256k1_n :: Integer

for the signatures, we also need mod n arithmetic, not only mod p...

newtype Fn

The prime field Fn (n seems to be a prime, after all)

Constructors

Fn Integer

Instances

Eq Fn

Methods

(==) :: Fn -> Fn -> Bool

(/=) :: Fn -> Fn -> Bool

Fractional Fn

Methods

(/) :: Fn -> Fn -> Fn

recip :: Fn -> Fn

fromRational :: Rational -> Fn

Num Fn

Methods

(+) :: Fn -> Fn -> Fn

(-) :: Fn -> Fn -> Fn

(*) :: Fn -> Fn -> Fn

negate :: Fn -> Fn

abs :: Fn -> Fn

signum :: Fn -> Fn

fromInteger :: Integer -> Fn

Show Fn

Methods

showsPrec :: Int -> Fn -> ShowS

show :: Fn -> String

showList :: [Fn] -> ShowS

toFn :: Integer -> Fn

fromFn :: Fn -> Integer

pow_n :: Fn -> Fn -> Fn

modn :: Integer -> Integer

helper function: Modulo n

invFn :: Integer -> Integer

Multiplicative inverse in Fp

powFn :: Integer -> Integer -> Integer

(Fast) exponentiation in Fn