The Tiger hash family is a group of cryptographic hash functions designed by Ross Anderson and Eli Biham in 1995. It generates hash values of 192 bits and operates on 512-bit blocks, making it suitable for applications requiring high-speed hashing, such as checksums and data integrity verification.

It follows a Merkle–Damgård construction, where the input data is split into blocks and processed sequentially. The Tiger2 hash is identical to the Tiger hash with the exception of padding with 0x80 (MD4, MD5, SHA) instead of 0x01 (Tiger). The Tiger hash family is rarely used today.

The original paper by Ross Anderson and Eli Biham is available at https://link.springer.com/chapter/10.1007/3-540-60865-6_46.