Portability | Good |
---|---|
Stability | experimental |
Maintainer | Marcel Fourné (mail@marcelfourne.de) |
Safe Haskell | None |
A hopefully timing attack resistant F(2^e) backend, i.e. binary representation polynomial arithmetic The presented interface is Big Endian, like Data.Bits All indices are [0 .. (length - 1)] TODO: further optimization
Documentation
F2 consist of an exact length of meaningful bits an a representation of those bits in a possibly larger Vector of Words, Note: The vectors use small to large indices, but the Data.Word endianness is of no concern as it is hidden by Data.Bits
Polynomial division, needs 3 parameters instead of 2, computing k/f mod m by binary inversion of f in m