TIGER128,3 Hash Tool

Other Hash Generator

MD2 MD4 MD5 SHA1 SHA224 SHA256 SHA384 SHA512/224 SHA512/256 SHA512 SHA3-224 SHA3-256 SHA3-384 SHA3-512 RIPEMD128 RIPEMD160 RIPEMD256 RIPEMD320 WHIRLPOOL TIGER128,3 TIGER160,3 TIGER192,3 TIGER128,4 TIGER160,4 TIGER192,4 SNEFRU SNEFRU256 GOST GOST-CRYPTO ADLER32 CRC32 CRC32B CRC32C FNV132 FNV1A32 FNV164 FNV1A64 JOAAT MURMUR3A MURMUR3C MURMUR3F XXH32 XXH64 XXH3 XXH128 HAVAL128,3 HAVAL160,3 HAVAL192,3 HAVAL224,3 HAVAL256,3 HAVAL128,4 HAVAL160,4 HAVAL192,4 HAVAL224,4 HAVAL256,4 HAVAL128,5 HAVAL160,5 HAVAL192,5 HAVAL224,5 HAVAL256,5 

The Tiger128,3 algorithm is a cryptographic hash function designed to produce a fixed-length output of 128 bits. It is a variant of the original Tiger hash family, optimized for performance on 64-bit platforms. The algorithm is constructed to ensure strong diffusion and collision resistance while maintaining computational efficiency.

Internal Structure

Tiger128,3 processes input data in blocks of 512 bits, dividing each block into eight 64-bit words. The algorithm employs three parallel passes, where each pass executes a series of operations including modular addition, bitwise rotation, and S-box substitutions. Each pass uses a different sequence of constants to increase the non-linearity and avalanche effect in the resulting hash.

Initialization

The algorithm begins by initializing four 64-bit state variables. These state variables are set to predefined constants that serve as the initial chaining values. The initial values are critical to ensure uniform hash distribution and to prevent trivial collisions.

Processing Blocks

Each 512-bit message block undergoes a three-pass transformation. In each pass, the state variables are updated through a combination of key-dependent S-box lookups, bitwise rotations, and modular additions. The outputs of each pass are then combined using exclusive OR operations with the original state values, ensuring that each message block has a significant impact on the final hash output.

Finalization

After processing all message blocks, the algorithm applies a finalization step to produce the 128-bit output. This step involves padding the last block, incorporating the message length, and performing a final mixing of the state variables. The resulting hash is highly sensitive to input changes and maintains a strong avalanche effect.

Security Properties

Tiger128,3 is designed to resist known cryptographic attacks, including preimage and collision attacks. Its three-pass structure and use of multiple S-boxes increase the computational effort required for an attacker to find a collision. The algorithm also ensures a uniform distribution of output values, reducing statistical bias and enhancing resistance to differential cryptanalysis.

Performance Characteristics

Optimized for 64-bit architectures, Tiger128,3 provides fast hashing performance while maintaining strong security properties. It is suitable for applications requiring rapid hash computations, such as digital signatures, data integrity verification, and key derivation functions.