Documentation

Fixed-size context representing the state of a partial HMAC computation with a complete HMAC key and a partial message parameter.

A precomputed HMAC key. Computing an HMAC key costs two SHA256 blocks.

No additional blocks are incurred for keys that are 64 bytes or less in length. Keys that are longer than 64 bytes long must be first hashed with SHA256 before the key can be derived, incurring extra blocks.

It is not uncommon that implementations of PBKDF2, HKDF, etc unnecessarily redo this computation even though a single HMAC key is used repeatedly.

TODO: FIXME: this data structure is way larger than it should be. We can pack this into a single 64-byte bytestring, but right now it's 208 bytes of data plus extra overhead.

On the other hand, this approach may actually be more efficient for the core PHKDF algorithm as currently implemented. Reducing the size of this data structure while maintaining tight code involves some additional work on cryptohash-sha256

Precompute an HMAC key for some literal HMAC key.

Initialize a new empty HMAC context from a literal HMAC key.

Initialize a new empty HMAC context from a precomputed HMAC key.

Append a bytestring onto the end of the message argument to HMAC.

Append zero or more bytestrings onto the end of the message argument to HMAC.

Finish computing the final 32-byte hash for an HMAC context.