Safe Haskell	None
Language	Haskell2010

Pairing.Fr

Contents

Orphan instances

Description

Prime field from which exponents should be chosen

Synopsis

type Fr = PrimeField 21888242871839275222246405745257275088548364400416034343698204186575808495617
isRootOfUnity :: Integer -> Fr -> Bool
isPrimitiveRootOfUnity :: Integer -> Fr -> Bool
primitiveRootOfUnity :: Int -> Fr
precompRootOfUnity :: Int -> Fr

Documentation

type Fr = PrimeField 21888242871839275222246405745257275088548364400416034343698204186575808495617 Source #

Prime field Fr with characteristic _r

isRootOfUnity :: Integer -> Fr -> Bool Source #

isPrimitiveRootOfUnity :: Integer -> Fr -> Bool Source #

primitiveRootOfUnity :: Int -> Fr Source #

Compute primitive roots of unity for 2^0, 2^1, ..., 2^28. (2^28 is the largest power of two that divides _r - 1, therefore there are no primitive roots of unity for higher powers of 2 in Fr.)

precompRootOfUnity :: Int -> Fr Source #

Orphan instances

Ord Fr Source #
Instance details Methods compare :: Fr -> Fr -> Ordering # (<) :: Fr -> Fr -> Bool # (<=) :: Fr -> Fr -> Bool # (>) :: Fr -> Fr -> Bool # (>=) :: Fr -> Fr -> Bool # max :: Fr -> Fr -> Fr # min :: Fr -> Fr -> Fr #