Safe Haskell	Safe
Language	Haskell98

Bitcoin.Crypto.FiniteField.Naive.Fn

Contents

Description

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.

Synopsis

Documentation

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

newtype Fn Source #

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

Constructors

Instances

Eq Fn Source #
Methods (==) :: Fn -> Fn -> Bool # (/=) :: Fn -> Fn -> Bool #
Fractional Fn Source #
Methods (/) :: Fn -> Fn -> Fn # recip :: Fn -> Fn # fromRational :: Rational -> Fn #
Num Fn Source #
Methods (+) :: Fn -> Fn -> Fn # (-) :: Fn -> Fn -> Fn # (*) :: Fn -> Fn -> Fn # negate :: Fn -> Fn # abs :: Fn -> Fn # signum :: Fn -> Fn # fromInteger :: Integer -> Fn #
Show Fn Source #
Methods showsPrec :: Int -> Fn -> ShowS # show :: Fn -> String # showList :: [Fn] -> ShowS #

helper function: Modulo n

Multiplicative inverse in Fp

(Fast) exponentiation in Fn