SHA-3 384-bit Hash Calculator

SHA-3 (Secure Hash Algorithm 3) is a cryptographic hash function that produces a 384-bit (48-byte) message digest. It was designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, and was selected as the winner of the NIST hash function competition in 2012. SHA-3 is standardized in FIPS PUB 202.

The SHA-3-384 variant uses a rate of 832 bits and a capacity of 768 bits, providing 192-bit security against collision attacks and 384-bit security against preimage attacks.

The process of generating a SHA-3-384 hash involves the following steps:

1. Padding: The message is padded using SHA-3's domain separation and pad10*1 rule so that its total length is a multiple of 832 bits (the rate).

2. Absorbing: The padded message is divided into 832-bit blocks, and each block is XORed into the rate portion of the 1600-bit internal state. After each block is absorbed, the Keccak-f[1600] permutation is applied to the entire state.

3. Squeezing: After all blocks are absorbed, 384 bits of output are extracted from the rate portion of the state. Since 384 bits is less than the 832-bit rate, only one squeeze iteration is needed.

Unlike SHA-2, which uses the Merkle-Damgård construction, SHA-3 is based on the sponge construction. This makes SHA-3 inherently resistant to length extension attacks.

The Keccak-f[1600] permutation operates on a 1600-bit state represented as a 5×5×64 array of bits. It consists of 24 rounds, each involving five operations: theta, rho, pi, chi, and iota.

SHA-3-384 is recommended for applications requiring a security level between SHA-3-256 and SHA-3-512, such as digital signatures and certificate generation where 192-bit collision resistance is desired.