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

Math.FiniteField.Conway

Description

Synopsis

Documentation

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

Instances

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

Defined in Math.FiniteField.Conway

Methods

showsPrec :: Int -> ConwayPoly p m -> ShowS #

show :: ConwayPoly p m -> String #

showList :: [ConwayPoly p m] -> ShowS #

data SomeConwayPoly Source #

Constructors

forall p m. SomeConwayPoly (ConwayPoly p m) 

Instances

Instances details
Show SomeConwayPoly Source # 
Instance details

Defined in Math.FiniteField.Conway

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

The prime characteristic p

conwayDim :: ConwayPoly p m -> Int Source #

The dimension m of F_q over F_p

conwayParams :: ConwayPoly 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 (ConwayPoly 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 (ConwayPoly p m) Source # 
Instance details

Methods

showsPrec :: Int -> ConwayPoly p m -> ShowS #

show :: ConwayPoly p m -> String #

showList :: [ConwayPoly p m] -> ShowS #