Loading CryptoViz...
Loading page content...Loading CryptoViz...
Loading page content...Fast tree-hashing XOF (Bertoni, Daemen et al., 2016). GENUINE REUSE of sha3.ts Keccak-p permutation, parameterized for 12 rounds instead of 24. TREE-HASHING STRUCTURE: input split into 8192-byte chunks processed independently (in principle, in parallel), then combined via root computation. Fundamentally different from sequential hashes. IRTF-documented. Status: secure.
Imported traces are validated and replayed locally. They never run a cipher operation automatically.
Continue your cryptography learning path
Russian national hash function (GOST R 34.11-2012, RFC 6986). 512-bit internal state processed through 12 rounds of a Kuznyechik-family SPN in a Miyaguchi-Preneel-like compression function, with a unique checksum-based finalization step.
Secure Hash Algorithm 2. Produces a unique 256-bit hash output representing the input message.
NIST SP 800-232 LWC standard. SPARKLE-384 permutation sponge, 128-bit rate, 256-bit output. Alzette ARX-box.
Related Resources