lol-0.0.1.0: A library for lattice cryptography.

Safe HaskellNone
LanguageHaskell2010

Crypto.Lol.Types.PrimeField

Description

Prime-order fields.

Synopsis

Documentation

type PrimeField fp = (Enumerable fp, Eq fp, ZeroTestable fp, Field fp, IrreduciblePoly fp) Source

Constraint synonym for prime-order fields.

type family CharOf fp :: Nat Source

The characteristic of a field, represented as a type.

Instances

type CharOf * (ZqBasic Nat p z) = p Source 

class (Ring fp, Prime (CharOf fp)) => IrreduciblePoly fp where Source

Represents prime-order fields that support embedding into a larger finite field using an irreducible polynomial. An instance of this class is defined in IrreducibleChar2 and exported from Lol.

taggedProxy :: Tagged s (Proxy s) Source

Convenience function for writing IrreduciblePoly instances.

data X Source

Convenience data type for writing IrreduciblePoly instances.

Constructors

X 

(^) :: Ring a => X -> Int -> Polynomial a Source

Convenience function for writing IrreduciblePoly instances.