Codec.Crypto.ECC.Base

ECC Base algorithms & point formats

Documentation

data EC a where

all Elliptic Curves, the parameters being the BitLength L, A, B and P

Constructors

ECi :: (BitLength, Integer, Integer, Integer, Integer) -> EC Integer

ECb :: (BitLength, F2, F2, F2, F2) -> EC F2

Instances

Eq (EC a)

Show (EC a)

Serialize (EC Integer)

getBitLength :: EC a -> Int

get bitlength

geta :: EC a -> a

get Curve parameter A

getb :: EC a -> a

get Curve parameter B

getp :: EC a -> a

get Curve parameter P

getr :: EC a -> a

get Curve order r

data ECPF a where

data of all Elliptic Curve Points

Constructors

ECPa :: (EC Integer, Integer, Integer) -> ECPF Integer

ECPp :: (EC Integer, Integer, Integer, Integer) -> ECPF Integer

ECPj :: (EC Integer, Integer, Integer, Integer) -> ECPF Integer

ECPmj :: (EC Integer, Integer, Integer, Integer, Integer) -> ECPF Integer

ECPaF2 :: (EC F2, F2, F2) -> ECPF F2

ECPpF2 :: (EC F2, F2, F2, F2) -> ECPF F2

ECPInfI :: EC Integer -> ECPF Integer

ECPInfF2 :: EC F2 -> ECPF F2

Instances

Eq (ECPF a)

Show (ECPF a)

Serialize (ECPF Integer)

getCurve :: ECPF a -> EC a

get contents of the curve

getx :: ECPF a -> a

generic getter, returning the x-value

gety :: ECPF a -> a

generic getter, returning the y-value

getz :: ECPF a -> a

generic getter, returning the z-value for points having them

getaz4 :: ECPF a -> a

generic getter, returning the a*z^4-value for points having them

getxA :: ECPF a -> a

generic getter, returning the affine x-value

getyA :: ECPF a -> a

generic getter, returning the affine y-value

padd :: ECPF a -> ECPF a -> ECPF a

add 2 elliptic points

pdouble :: ECPF a -> ECPF a

add an elliptic point onto itself, base for padd a a

modinv

Arguments

:: Integral a

=> a

the number to invert

-> a

the modulus

-> a

the inverted value

computing the modular inverse of a mod m

pmul :: ECPF a -> Integer -> ECPF a

this is a generic handle for Point Multiplication. The implementation may change.

ison :: ECPF a -> Bool

generic verify, if generic ECP is on EC via getxA and getyA

binary :: Integer -> String

binary representation of an integer |taken from http:haskell.orghaskellwikiFibonacci_primes_in_parallel