HMAC.digest_size The size of the resulting HMAC digest in bytes.

hashlib.algorithms_available A set containing the names of the hash algorithms that are available in the running Python interpreter

hash.name The canonical name of this hash, always lowercase and always suitable as a parameter to new() to create

hash.digest_size The size of the resulting hash in bytes.

HMAC.block_size The internal block size of the hash algorithm in bytes.

hashlib.new(name[, data]) Is a generic constructor that takes the string name of the desired algorithm as its first parameter

hmac.compare_digest(a, b) Return a == b. This function uses an approach designed to prevent timing analysis by

hash.hexdigest() Like digest() except the digest is returned as a string object of double length, containing only

HMAC.copy() Return a copy (“clone”) of the hmac object. This can be used to efficiently compute the digests of strings that

HMAC.digest() Return the digest of the bytes passed to the update() method so far. This bytes object will be the