SNEFRU 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,5The SNEFRU algorithm is a cryptographic hash function designed to generate fixed-size digests from variable-length input messages. It operates using a combination of substitution and permutation operations organized into multiple rounds. The function accepts messages of arbitrary length and produces hash outputs of a predetermined size, typically 128 or 256 bits. The internal structure of SNEFRU includes a message padding process, an initial value setup, and iterative transformations that ensure diffusion and confusion of input data.
Message Preprocessing
Before the main hashing process, the input message undergoes padding to align with the block size required by the algorithm. Padding involves appending bits to the message so that its total length becomes a multiple of the block size. This ensures that each block is processed consistently during the iterative steps. The algorithm also appends the original message length to the padded message to preserve uniqueness and prevent collisions.
Round Structure
SNEFRU executes multiple rounds, each consisting of a sequence of substitution and permutation steps. In each round, the message block is divided into smaller segments, which are then combined with round-specific constants. Substitution operations apply fixed nonlinear functions to the segments, while permutation operations rearrange bits or bytes to achieve high diffusion. The combination of these operations ensures that small changes in the input message result in significant differences in the final hash output.
Mixing Function
The algorithm uses a mixing function to interleave the results of substitution and permutation. This function incorporates modular arithmetic and bitwise operations to blend the transformed data, increasing the resistance against cryptanalytic attacks. The mixing function is applied iteratively across all rounds, gradually transforming the initial message into a final hash value.
Finalization
After completing all rounds, the resulting data is combined and reduced to the desired hash size. The final hash output is derived by extracting specific portions of the internal state, ensuring that the output uniquely represents the original input. The structure and operations of SNEFRU provide resistance against preimage, second-preimage, and collision attacks, making it suitable for secure hashing applications.