| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Crypto.Lol.Types.PrimeField
Description
Prime-order fields.
- type PrimeField fp = (Enumerable fp, Eq fp, ZeroTestable fp, Field fp, IrreduciblePoly fp)
- type family CharOf fp :: Nat
- class (Ring fp, Prime (CharOf fp)) => IrreduciblePoly fp where
- irreduciblePoly :: Reflects deg Int => Tagged deg (Polynomial fp)
- taggedProxy :: Tagged s (Proxy s)
- data X = X
- (^) :: Ring a => X -> Int -> Polynomial a
Documentation
type PrimeField fp = (Enumerable fp, Eq fp, ZeroTestable fp, Field fp, IrreduciblePoly fp) Source
Constraint synonym for prime-order fields.
class (Ring fp, Prime (CharOf fp)) => IrreduciblePoly fp where Source
Represents prime-order fields over which we can get irreducible
polynomials of desired degree. (An instance of this class is
defined in IrreducibleChar2 and exported from
Lol.)
Methods
irreduciblePoly :: Reflects deg Int => Tagged deg (Polynomial fp) Source
taggedProxy :: Tagged s (Proxy s) Source
Convenience function for writing IrreduciblePoly instances.
(^) :: Ring a => X -> Int -> Polynomial a Source
Convenience function for writing IrreduciblePoly instances.