The Tiger hash processes data in 512-bit blocks and produces a 192-bit message digest. This hash was designed by Ross Anderson and Eli Biham (see http://www.cs.technion.ac.il/~biham/Reports/Tiger/), with the goal of producing a secure, fast hash function that performs especially well on next-generation 64-bit architectures, being still efficient on 32 and 16-bit architectures.
Tiger tree hash
Tiger Tree cryptographic hash is calculated by applying the Tiger hash to 1024-byte blocks of a stream, then combining the interim values through a binary hash tree.
This implementation method is specially useful as a secure way to validate transfers, especially blocks of a file and prevent corruption in distributed systems.Last modified on 21 June 2010, at 21:04