finite-fields-0.1: Arithmetic in finite fields
Safe HaskellNone
LanguageHaskell2010

Math.FiniteField.Conway

Description

Synopsis

Documentation

data HasConwayPoly (p :: Nat) (m :: Nat) Source #

Instances

Instances details
Show (HasConwayPoly p m) Source # 
Instance details

Defined in Math.FiniteField.Conway

data SomeConwayPoly Source #

Constructors

forall p m. SomeConwayPoly (HasConwayPoly p m) 

Instances

Instances details
Show SomeConwayPoly Source # 
Instance details

Defined in Math.FiniteField.Conway

conwayPrime :: HasConwayPoly p m -> IsSmallPrime p Source #

The prime characteristic p

conwayDim :: HasConwayPoly p m -> Int Source #

The dimension m of F_q over F_p

conwayParams :: HasConwayPoly p m -> (Int, Int) Source #

The pair (p,m)

lookupSomeConwayPoly :: Int -> Int -> Maybe SomeConwayPoly Source #

Usage: lookupSomeConwayPoly p m for q = p^m

lookupConwayPoly :: SNat64 p -> SNat64 m -> Maybe (HasConwayPoly p m) Source #

Usage: lookupConwayPoly sp sm for q = p^m

lookupConwayPrimRoot :: Int -> Maybe Int Source #

We have some Conway polynomials for m=1 too; the roots of these linear polynomials are primitive roots in F_p

Orphan instances

Show (HasConwayPoly p m) Source # 
Instance details