elliptic-curve-0.2.1: Elliptic curve library

Safe HaskellNone
LanguageHaskell2010

Curve

Synopsis

Documentation

data Coordinates Source #

Curve coordinates.

Constructors

Affine 
Jacobian 
Projective 

data Form Source #

Curve forms.

class (GaloisField q, GaloisField r, Group (Point f c e q r)) => Curve (f :: Form) (c :: Coordinates) e q r where Source #

Elliptic curves.

Minimal complete definition

char, cof, disc, fromA, point, pointX, toA, yX

Associated Types

data Point f c e q r :: * Source #

Curve point.

Methods

char :: Point f c e q r -> Integer Source #

Curve characteristic.

cof :: Point f c e q r -> Integer Source #

Curve cofactor.

disc :: Point f c e q r -> q Source #

Curve discriminant.

mul :: r ~ PrimeField p => Point f c e q r -> r -> Point f c e q r Source #

Curve point multiplication.

point :: q -> q -> Maybe (Point f c e q r) Source #

Get point from X and Y coordinates.

pointX :: q -> Maybe (Point f c e q r) Source #

Get point from X coordinate.

yX :: Point f c e q r -> q -> Maybe q Source #

Get Y coordinate from X coordinate.

fromA :: Point f Affine e q r -> Point f c e q r Source #

Transform from affine coordinates.

toA :: Point f c e q r -> Point f Affine e q r Source #

Transform to affine coordinates.

Instances
WACurve e q r => Curve Weierstrass Affine (e :: k) q r Source # 
Instance details

Defined in Curve.Weierstrass

Associated Types

data Point Weierstrass Affine e q r :: Type Source #

WJCurve e q r => Curve Weierstrass Jacobian (e :: k) q r Source # 
Instance details

Defined in Curve.Weierstrass

Associated Types

data Point Weierstrass Jacobian e q r :: Type Source #

WPCurve e q r => Curve Weierstrass Projective (e :: k) q r Source # 
Instance details

Defined in Curve.Weierstrass

Associated Types

data Point Weierstrass Projective e q r :: Type Source #

MACurve e q r => Curve Montgomery Affine (e :: k) q r Source # 
Instance details

Defined in Curve.Montgomery

Associated Types

data Point Montgomery Affine e q r :: Type Source #

EACurve e q r => Curve Edwards Affine (e :: k) q r Source # 
Instance details

Defined in Curve.Edwards

Associated Types

data Point Edwards Affine e q r :: Type Source #

EPCurve e q r => Curve Edwards Projective (e :: k) q r Source # 
Instance details

Defined in Curve.Edwards

Associated Types

data Point Edwards Projective e q r :: Type Source #

BACurve e q r => Curve Binary Affine (e :: k) q r Source # 
Instance details

Defined in Curve.Binary

Associated Types

data Point Binary Affine e q r :: Type Source #

Methods

char :: Point Binary Affine e q r -> Integer Source #

cof :: Point Binary Affine e q r -> Integer Source #

disc :: Point Binary Affine e q r -> q Source #

mul :: r ~ PrimeField p => Point Binary Affine e q r -> r -> Point Binary Affine e q r Source #

point :: q -> q -> Maybe (Point Binary Affine e q r) Source #

pointX :: q -> Maybe (Point Binary Affine e q r) Source #

yX :: Point Binary Affine e q r -> q -> Maybe q Source #

fromA :: Point Binary Affine e q r -> Point Binary Affine e q r Source #

toA :: Point Binary Affine e q r -> Point Binary Affine e q r Source #

BPCurve e q r => Curve Binary Projective (e :: k) q r Source # 
Instance details

Defined in Curve.Binary

Associated Types

data Point Binary Projective e q r :: Type Source #

class (Arbitrary g, Eq g, Generic g, Monoid g, Pretty g, Random g, Show g) => Group g where Source #

Groups.

Minimal complete definition

add, dbl, def, gen, id, inv, order

Methods

add :: g -> g -> g Source #

Element addition.

dbl :: g -> g Source #

Element doubling.

def :: g -> Bool Source #

Check well-defined.

gen :: g Source #

Group generator.

id :: g Source #

Identity element.

inv :: g -> g Source #

Element inversion.

mul' :: g -> Integer -> g Source #

Element multiplication.

order :: g -> Integer Source #

Curve order.

rnd :: MonadRandom m => m g Source #

Random element.

Instances
FGroup k => Group (Element k) Source # 
Instance details

Defined in Group.Field

WPCurve e q r => Group (WPPoint e q r) Source # 
Instance details

Defined in Curve.Weierstrass

Methods

add :: WPPoint e q r -> WPPoint e q r -> WPPoint e q r Source #

dbl :: WPPoint e q r -> WPPoint e q r Source #

def :: WPPoint e q r -> Bool Source #

gen :: WPPoint e q r Source #

id :: WPPoint e q r Source #

inv :: WPPoint e q r -> WPPoint e q r Source #

mul' :: WPPoint e q r -> Integer -> WPPoint e q r Source #

order :: WPPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (WPPoint e q r) Source #

WJCurve e q r => Group (WJPoint e q r) Source # 
Instance details

Defined in Curve.Weierstrass

Methods

add :: WJPoint e q r -> WJPoint e q r -> WJPoint e q r Source #

dbl :: WJPoint e q r -> WJPoint e q r Source #

def :: WJPoint e q r -> Bool Source #

gen :: WJPoint e q r Source #

id :: WJPoint e q r Source #

inv :: WJPoint e q r -> WJPoint e q r Source #

mul' :: WJPoint e q r -> Integer -> WJPoint e q r Source #

order :: WJPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (WJPoint e q r) Source #

WACurve e q r => Group (WAPoint e q r) Source # 
Instance details

Defined in Curve.Weierstrass

Methods

add :: WAPoint e q r -> WAPoint e q r -> WAPoint e q r Source #

dbl :: WAPoint e q r -> WAPoint e q r Source #

def :: WAPoint e q r -> Bool Source #

gen :: WAPoint e q r Source #

id :: WAPoint e q r Source #

inv :: WAPoint e q r -> WAPoint e q r Source #

mul' :: WAPoint e q r -> Integer -> WAPoint e q r Source #

order :: WAPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (WAPoint e q r) Source #

MACurve e q r => Group (MAPoint e q r) Source # 
Instance details

Defined in Curve.Montgomery

Methods

add :: MAPoint e q r -> MAPoint e q r -> MAPoint e q r Source #

dbl :: MAPoint e q r -> MAPoint e q r Source #

def :: MAPoint e q r -> Bool Source #

gen :: MAPoint e q r Source #

id :: MAPoint e q r Source #

inv :: MAPoint e q r -> MAPoint e q r Source #

mul' :: MAPoint e q r -> Integer -> MAPoint e q r Source #

order :: MAPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (MAPoint e q r) Source #

EPCurve e q r => Group (EPPoint e q r) Source # 
Instance details

Defined in Curve.Edwards

Methods

add :: EPPoint e q r -> EPPoint e q r -> EPPoint e q r Source #

dbl :: EPPoint e q r -> EPPoint e q r Source #

def :: EPPoint e q r -> Bool Source #

gen :: EPPoint e q r Source #

id :: EPPoint e q r Source #

inv :: EPPoint e q r -> EPPoint e q r Source #

mul' :: EPPoint e q r -> Integer -> EPPoint e q r Source #

order :: EPPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (EPPoint e q r) Source #

EACurve e q r => Group (EAPoint e q r) Source # 
Instance details

Defined in Curve.Edwards

Methods

add :: EAPoint e q r -> EAPoint e q r -> EAPoint e q r Source #

dbl :: EAPoint e q r -> EAPoint e q r Source #

def :: EAPoint e q r -> Bool Source #

gen :: EAPoint e q r Source #

id :: EAPoint e q r Source #

inv :: EAPoint e q r -> EAPoint e q r Source #

mul' :: EAPoint e q r -> Integer -> EAPoint e q r Source #

order :: EAPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (EAPoint e q r) Source #

BPCurve e q r => Group (BPPoint e q r) Source # 
Instance details

Defined in Curve.Binary

Methods

add :: BPPoint e q r -> BPPoint e q r -> BPPoint e q r Source #

dbl :: BPPoint e q r -> BPPoint e q r Source #

def :: BPPoint e q r -> Bool Source #

gen :: BPPoint e q r Source #

id :: BPPoint e q r Source #

inv :: BPPoint e q r -> BPPoint e q r Source #

mul' :: BPPoint e q r -> Integer -> BPPoint e q r Source #

order :: BPPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (BPPoint e q r) Source #

BACurve e q r => Group (BAPoint e q r) Source # 
Instance details

Defined in Curve.Binary

Methods

add :: BAPoint e q r -> BAPoint e q r -> BAPoint e q r Source #

dbl :: BAPoint e q r -> BAPoint e q r Source #

def :: BAPoint e q r -> Bool Source #

gen :: BAPoint e q r Source #

id :: BAPoint e q r Source #

inv :: BAPoint e q r -> BAPoint e q r Source #

mul' :: BAPoint e q r -> Integer -> BAPoint e q r Source #

order :: BAPoint e q r -> Integer Source #

rnd :: MonadRandom m => m (BAPoint e q r) Source #