This tool computes the Whirlpool hash of any text and shows the full 512-bit digest as a 128-character hexadecimal string. Whirlpool is a cryptographic hash designed by Vincent Rijmen (co-author of AES) and Paulo Barreto, and is standardised in ISO/IEC 10118-3. It is a good choice when you want a very wide 512-bit digest from a well-studied AES-style design.
How it works
Whirlpool is built with the Miyaguchi-Preneel construction: a dedicated 512-bit block cipher called W is used as a compression function, where the message block is the plaintext and the running hash is the key. For each block the output is W(H, block) XOR block XOR H, which makes the round function one-way.
The cipher W operates on an 8x8 matrix of bytes for 10 rounds. Each round applies a non-linear S-box substitution (built from three 4-bit mini-boxes), a ShiftColumns cyclic permutation, a MixRows step that multiplies by an MDS matrix in GF(2^8) with the reduction polynomial 0x11d, and an AddRoundKey. The key schedule reuses the same round transformation, injecting a round constant derived from the S-box. This implementation generates the S-box and the eight 64-bit round tables at runtime, and uses BigInt for exact 64-bit row arithmetic, so it reproduces the ISO test vectors precisely.
Example and notes
The empty input hashes to 19fa61d7...42a66eb3 (the full value is shown in the FAQ above), and the string abc hashes to 4e2448a4c6f486bb16b6562c73b4020bf3043e3a731bce721ae1b303d97e6d4c7181eebdb6c57e277d0e34957114cbd6c797fc9d95d8b582d225292076d4eef5.
Whirlpool is a cryptographic hash for integrity, not a password hash — for storing passwords use a slow, salted function such as bcrypt or Argon2. Everything here runs locally in your browser; nothing is uploaded.