Digestif - Hash algorithms in C and OCaml

Build Status

Digestif is a toolbox which implements hashes:

Digestif uses a trick about linking and let the end-user to choose which implementation he wants to use. We provide 2 implementations:

Both are well-tested. However, OCaml implementation is slower than the C implementation.

Home page: http://din.osau.re/

Contact: Romain Calascibetta <romain.calascibet ta@gmail.com>

API

For each hash, we implement the same API which is referentially transparent. Then, on the top of these, we reflect functions (like digesti or hmaci) with GADT - however, conversion from GADT to hash type is not possible (but you can destruct GADT to a string).

Build Requirements

If you want to compile the test program, you need:

Credits

This work is from the nocrypto library and the Vincent hanquez's work in ocaml-sha.

All credits appear in the begin of files and this library is motivated by two reasons: