Portability | Good |
---|---|
Stability | experimental |
Maintainer | Danny Navarro <j@dannynavarro.net> |
Safe Haskell | None |
This module provides basic arithmetic operations over F₂m. Performance is not optimal and it doesn't provide protection against timing
attacks. The m
parameter is implicitly derived from the irreducible
polynomial where applicable.
Documentation
Multiplication over F₂m.
Squaring over F₂m. TODO: This is still slower than mulF2m
.
Binary polynomial reduction modulo using long division algorithm.
Inversion over F₂m using extended Euclidean algorithm.