The hF2 package

[Tags: bsd3, library]

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.


[Skip to ReadMe]

Properties

Versions0.1, 0.2
Change logNone available
Dependenciesbase (==4.*), cereal, vector [details]
LicenseBSD3
Copyright(c) Marcel Fourné, 2011-2013
AuthorMarcel Fourné
MaintainerMarcel Fourné (mail@marcelfourne.de)
Stabilityalpha
CategoryCryptography
UploadedSat Mar 9 13:35:15 UTC 2013 by MarcelFourne
DistributionsNixOS:0.2
Downloads512 total (17 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for hF2-0.2

This library was created as an offspring to hecc, the Haskell library for Elliptic Curve Cryptography, but it should be more general than that.
The aim is to have one (pure, Haskell) implementation for (binary) finite field arithmetic which is suitable for practical use in most cases.