Safe Haskell | None |
---|---|
Language | Haskell2010 |
Implementation of the optimal Ate pairing on the curve BN128
Synopsis
- reducedPairing :: G1 -> G2 -> GT
- atePairing :: G1 -> G2 -> Fq12
- finalExponentiation :: Fq12 -> GT
- finalExponentiationNaive :: Fq12 -> GT
- frobeniusNaive :: Num a => Int -> a -> a
- ateLoopCountBinary :: [Bool]
Documentation
finalExponentiation :: Fq12 -> GT Source #
A faster way of performing the final exponentiation step
finalExponentiationNaive :: Fq12 -> GT Source #
Naive implementation of the final exponentiation step
frobeniusNaive :: Num a => Int -> a -> a Source #
Iterated frobenius morphisms on fields of characteristic _q, implemented naively
ateLoopCountBinary :: [Bool] Source #
Binary expansion (missing the most-significant bit) representing the number 6 * _t + 2.
29793968203157093288 = 0b11001110101111001011100000011100110111110011101100011101110101000