pairing-0.1.4: Optimal ate pairing over Barreto-Naehrig curves

Safe HaskellSafe
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

Methods

asInteger :: Int -> Integer Source #

AsInteger Fq Source # 
Instance details

Defined in Pairing.Fq

Methods

asInteger :: Fq -> Integer Source #

AsInteger Fr Source # 
Instance details

Defined in Pairing.Fr

Methods

asInteger :: Fr -> Integer Source #

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 #

Instances
CyclicGroup GT Source # 
Instance details

Defined in Pairing.Group

Methods

generator :: GT Source #

order :: Proxy GT -> Integer Source #

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

inverse :: GT -> GT Source #

CyclicGroup G2 Source # 
Instance details

Defined in Pairing.Group

Methods

generator :: G2 Source #

order :: Proxy G2 -> Integer Source #

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

inverse :: G2 -> G2 Source #

CyclicGroup G1 Source # 
Instance details

Defined in Pairing.Group

Methods

generator :: G1 Source #

order :: Proxy G1 -> Integer Source #

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

inverse :: G1 -> G1 Source #

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

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