Tiger 192 Hash Calculator – 192-bit digests for text and files
The Tiger 192 hash calculator computes the Tiger cryptographic hash of anything you type or of a file you pick, without sending a single byte anywhere. Tiger was designed in 1995 by Ross Anderson and Eli Biham at Cambridge, and it was built for a world that was just starting to get 64-bit processors: where MD5 and SHA-1 shuffle 32-bit words, Tiger works on three 64-bit registers and four large lookup tables, which made it dramatically faster on Alpha and later on x86-64.
What Tiger actually does to your message
Your message is padded to a whole number of 512-bit blocks and each block is compressed into a state of three 64-bit registers named a, b and c. Each block runs through three passes of eight rounds — 24 rounds in total. A single round reads c ^= x, then a -= S(c), b += S(c) and finally b *= mul, where mul is 5 on the first pass, 7 on the second and 9 on the third. S(c) is four lookups into the four 256-entry S-boxes, indexed by four of the eight bytes of c. Between passes a non-linear key schedule stirs the eight message words, and each block closes with the feed-forward a ^= aa; b -= bb; c += cc. The final a, b and c are the 24-byte digest.
Tiger vs Tiger2: one byte of difference
Tiger terminates the message with the byte 0x01, a habit inherited from MD4. Tiger2 switched to 0x80, the convention that MD5, SHA-1 and SHA-2 all use. That is the only difference between them, yet it produces digests that share nothing: Tiger of the empty string is 3293ac630c13f0245f92bbb1766e16167a4e58492dde73f3 while Tiger2 of the empty string is 4441be75f6018773c206c22745374b924aa8313fef919f41. This calculator shows both at once, so you can tell in one glance which one your source system used.
Byte order, the other reason digests disagree
The state is three 64-bit numbers, and implementations disagree about how to write them down. The reference implementation dumps the register file of a little-endian machine, so each register appears least-significant byte first — that is the form used by every published Tiger test vector and by the base32 hashes in urn:tree:tiger magnet links, and it is this calculator's default. Implementations that print each register as a 64-bit number instead emit the same 24 bytes with every 8-byte group reversed, which is why two tools can disagree on a digest neither of them got wrong. The byte order toggle renders both, and the result panel always lists the twin alongside the value you asked for.
Tiger/160 and Tiger/128
There is no separate short algorithm. Tiger/160 is the first 20 bytes of the 192-bit digest and Tiger/128 is the first 16, kept for older protocols with fixed-width checksum fields. Because they are simple prefixes, a correct Tiger/128 value will always be the opening 32 hex characters of the Tiger/192 value for the same input — a quick way to sanity-check a legacy record.
Where Tiger is still used
Tiger's most visible descendant is the Tiger Tree Hash (TTH), a Merkle tree over 1024-byte chunks that Direct Connect, DC++ and Gnutella use to identify and verify shared files. A TTH root is published as a 39-character base32 string, which is why this tool offers base32 output in the same encoding and byte order. Note that a TTH root is not a plain Tiger digest: the THEX rules prepend a 0x00 byte to every leaf and a 0x01 byte to every internal node before hashing, so this page computes the underlying primitive rather than the tree. Tiger also turns up in older archive formats, in checksum listings for long-lived downloads, and in interoperability tests against mhash and PHP's hash('tiger192,3', …).
Hashing files and comparing checksums
Switch to File mode to hash a local file of up to 5 MB by picking it or dropping it on the upload area. The bytes are read by the browser and hashed in the page; the file is never uploaded. Paste a published checksum into compare with hash and the tool normalises case, whitespace and a leading 0x, accepts hex or base64, and highlights the first hex character that differs. If the length does not match the variant you selected, it tells you that instead of reporting a bogus mismatch.
HMAC, salt and iteration
Entering an HMAC key switches the tool to HMAC-Tiger(key, message) using the standard ipad/opad construction over Tiger's 64-byte block size, with over-long keys hashed first, exactly as RFC 2104 specifies. A salt can be prepended or appended before hashing, and iterations repeats the hash over its own output up to ten thousand times. Both are there to make a point, not to secure anything.
Is Tiger still safe?
There is no published collision on the full 24-round Tiger, but there are attacks on reduced-round variants, and the design has not been maintained or standardised since the 1990s. It is a reasonable choice for the integrity checks and legacy interoperability it is already used for. For anything new, pick SHA-256 or SHA-3, both of which are standardised, widely reviewed and available natively in every browser and runtime.