Hash Lab

Cryptographic

SHA3-256

A 256-bit hash function based on the Keccak sponge construction, designed by Bertoni, Daemen, Peeters, and Van Assche; selected as the SHA-3 standard by NIST in 2015 (FIPS 202). A drop-in alternative to SHA-256 with a fundamentally different internal design , chosen precisely so a future attack on SHA-2 would not also break SHA-3.

At a glance

Output256 bits (32 bytes, 64 hex chars)
State1600 bits (5×5×64)
Rate / capacity1088 / 512 bits
ConstructionSponge over the Keccak-f[1600] permutation
Rounds24
StandardNIST FIPS 202 (2015)
Collision security2128 generic
Preimage security2256 generic
Length extensionNo
StatusModern, recommended

Sponge construction, in two paragraphs

SHA3-256 maintains a 1600-bit state, partitioned into a 1088-bit “rate” and a 512-bit “capacity”. To absorb a message, XOR rate-sized blocks into the state and apply the Keccak-f[1600] permutation between blocks. To squeeze output, take rate-sized chunks of the state (possibly applying the permutation again between chunks). For SHA3-256 only one squeeze block is needed because the digest is 256 bits.

The capacity is never directly exposed to the attacker: input mixes with the rate, and only after the permutation can the capacity affect the output. That construction (with capacity at least 2× the security level) gives SHA-3 its main differentiators over SHA-2: a clean security proof in the random-permutation model, and immunity to length-extension.

Where it is used

Security status

No collision or preimage attack better than the generic bound is known on full SHA-3. The most progress has come on reduced-round Keccak variants and on related-key / structural distinguishers that do not translate to real attacks on the standard.

SHA-3 family relationships

Try it

The multi-algorithm hasher includes SHA3-256 alongside SHA-256, BLAKE2b, and BLAKE3, so the lengths and family differences are visible at a glance.

References

Visualize

SHA3-256 on your input

11 bytes · 0-bit digest

Hex digest

Bit grid (0 bits, teal = 1, slate = 0)

Byte pixel art (0 bytes, hue = byte value mod 360°)

Avalanche , flipping the lowest bit of the first input byte changed 0 of 0 output bits

Test Your Knowledge

Quick MCQ check on this algorithm

Start Quiz →

AI Summary

Summarize this page in your favorite LLM