In favour of


F(2^e) math for cryptography

Latest on Hackage:0.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

BSD-3-Clause licensed by Marcel Fourné
Maintained by Marcel Fourné (

This library implements polynomials on Binary Fields F(2^e), a subform of Finite Fields F(p^n) also known as Galois Fields GF(p^n). It is intended as a backend for cryptographic use and the code should be timing attack resistant.