Tiger (hash)
|
|
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1996 with a view for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits.
It is frequently used in Merkle Hash Tree form, where it is referred to as TTH (Tiger-Tree Hash). TTH is used by many clients on the Direct Connect and Gnutella file sharing networks.
The BitPrint hash uses Tiger and SHA-1.
An updated version named Tiger2 is planned to be released.
| Contents |
Tiger hashes
The 192-bit (24-byte) Tiger hashes are typically represented as 48-digit hexadecimal numbers. The following demonstrates a 43-byte ASCII input and the corresponding Tiger hashes:
- Tiger("The quick brown fox jumps over the lazy dog") = 6d12a41e72e644f017b6f0e2f7b44c6285f06dd5d2c5b075
- Tiger2("The quick brown fox jumps over the lazy dog") = 976abff8062a2e9dcea3a1ace966ed9c19cb85558b4976d8
Even a small change in the message will (with overwhelming probability) result in a completely different hash, e.g. changing d to c:
- Tiger("The quick brown fox jumps over the lazy cog") = a8f04b0f7201a0d728101c9d26525b31764a3493fcd8458f
- Tiger2("The quick brown fox jumps over the lazy cog") = 09c11330283a27efb51930aa7dc1ec624ff738a8d9bdd3df
The hash of the zero-length string is:
- Tiger("") = 3293ac630c13f0245f92bbb1766e16167a4e58492dde73f3
- Tiger2("") = 4441be75f6018773c206c22745374b924aa8313fef919f41
See also
References
- Tiger — A Fast New Hash Function, by Ross Anderson and Eli Biham, proceedings of Fast Software Encryption 3, Cambridge, 1996.
External links
- The Tiger home page (http://www.cs.technion.ac.il/~biham/Reports/Tiger/)
- Jacksum (http://www.jonelo.de/java/jacksum/index.html) (a program with various message verification functions, including Tiger)
Template:Cryptographic hash functionsde:Tiger (Hash-Funktion) fr:Tiger (hash)