Pairing.Pairing

Implementation of the optimal Ate pairing on the curve BN128

Documentation

reducedPairing :: G1 -> G2 -> GT

Optimal Ate pairing (including final exponentiation step)

atePairing :: G1 -> G2 -> Fq12

Optimal Ate pairing without the final exponentiation step

finalExponentiation :: Fq12 -> GT

A faster way of performing the final exponentiation step

finalExponentiationNaive :: Fq12 -> GT

Naive implementation of the final exponentiation step

frobeniusNaive :: Num a => Int -> a -> a

Iterated frobenius morphisms on fields of characteristic _q, implemented naively

ateLoopCountBinary :: [Bool]

Binary expansion (missing the most-significant bit) representing the number 6 * _t + 2.

29793968203157093288
= 0b11001110101111001011100000011100110111110011101100011101110101000