hF2: F(2^e) math for cryptography

[ bsd3, cryptography, deprecated, library ] [ Propose Tags ] [ Report a vulnerability ]

Deprecated in favor of eccrypto

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]

Modules

[Index]

Data
- Data.F2

Downloads

hF2-0.2.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

MarcelFourne

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.1, 0.2
Dependencies	base (>=4 && <5), cereal, vector [details]
License	BSD-3-Clause
Copyright	(c) Marcel Fourné, 2011-2013
Author	Marcel Fourné
Maintainer	Marcel Fourné (mail@marcelfourne.de)
Category	Cryptography
Uploaded	by MarcelFourne at 2013-03-09T13:35:15Z
Distributions
Reverse Dependencies	2 direct, 2 indirect [details]
Downloads	2054 total (4 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]

Readme for hF2-0.2

[back to package description]

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.