pairing-0.4.1: Bilinear pairings

Safe HaskellNone
LanguageHaskell2010

Pairing.CyclicGroup

Synopsis

Documentation

class AsInteger a where Source #

Methods

asInteger :: a -> Integer Source #

Instances
AsInteger Int Source # 
Instance details

Defined in Pairing.CyclicGroup

AsInteger Integer Source # 
Instance details

Defined in Pairing.CyclicGroup

AsInteger (PrimeField p) Source # 
Instance details

Defined in Pairing.CyclicGroup

class Monoid g => CyclicGroup g where Source #

Methods

generator :: g Source #

order :: Proxy g -> Integer Source #

expn :: AsInteger e => g -> e -> g Source #

inverse :: g -> g Source #

random :: MonadRandom m => m g Source #

Instances
CyclicGroup GT Source # 
Instance details

Defined in Pairing.Group

CyclicGroup G2 Source # 
Instance details

Defined in Pairing.Group

CyclicGroup G1 Source # 
Instance details

Defined in Pairing.Group

class FromX a where Source #

Methods

yFromX :: a -> (a -> a -> a) -> Maybe a Source #

isOdd :: a -> Bool Source #

Instances
FromX Fq2 Source # 
Instance details

Defined in Pairing.Fq

Methods

yFromX :: Fq2 -> (Fq2 -> Fq2 -> Fq2) -> Maybe Fq2 Source #

isOdd :: Fq2 -> Bool Source #

FromX Fq Source # 
Instance details

Defined in Pairing.Fq

Methods

yFromX :: Fq -> (Fq -> Fq -> Fq) -> Maybe Fq Source #

isOdd :: Fq -> Bool Source #

class Validate a where Source #

Methods

isValidElement :: a -> Bool Source #

Instances
Validate GT Source # 
Instance details

Defined in Pairing.Group

Validate G2 Source # 
Instance details

Defined in Pairing.Group

Validate G1 Source # 
Instance details

Defined in Pairing.Group

sumG :: (Foldable t, CyclicGroup g) => t g -> g Source #

Sum all the elements of some container according to its group structure.