Polski English

Fletcher 32

Fletcher 32 is a Fletcher family algorithm invented by John G. Fletcher .

The algorithm was presented in/on IEEE Transactions on Communications in January 1982.

The digest (hash generated by this algorithm) is 32 bits (4 Bytes) in length.

You can read more about it on this page.

Fletcher 32 is supported by Easy Hash:

Other hash algorithms

Adler-16 Adler-32 Adler-8 AP Hash APHash (b) BKDR Hash BLAKE-256 BLAKE-512 CARP CityHash CK Sum CRC DNP CRC-16 CRC-16 CCITT (0x1D0F) CRC-16 CCITT (0xFFFF) CRC-16 IBM CRC-16 Kermit CRC-16 LHA CRC-16 Modbus CRC-16 Sick CRC-16 X.25 CRC-16 XModem CRC-24 CRC-32 CRC-32 Bzip2 CRC-32 Jamcrc CRC-32 Posix CRC-32 ZModem CRC-32C CRC-64 CRC-64 ECMA-182 DEK Hash DJB Hash Easy Text Hash ECOH ELF Hash Fast Syndrome Based Hash FCS-16 FCS-32 Fletcher 16 Fletcher 32 Fletcher 8 FNV-0 FNV-1 FNV-1a FORK-256 GHash 3 GHash 5 GOST R 34.11-94 Grostl HAS-160 HAVAL 128 HAVAL 160 HAVAL 192 HAVAL 224 HAVAL 256 JH JHash JS Hash Keccak (removed) Luhn MD2 MD4 MD5 Murmur Hash Murmur Hash 2 MySQL 3 One at a time Panama Pearson Hash PJW Hash RadioGatĂșn RIPEMD-128 RIPEMD-160 RIPEMD-256 RIPEMD-320 RS Hash Sapphire 128 Sapphire 160 Sapphire 192 Sapphire 224 Sapphire 256 Sapphire 288 Sapphire 320 SDBM Hash SHA-0 SHA-1 SHA-224 SHA-256 SHA-384 SHA-512 Size64 Snefru Sum BSD Sum System V Sum-16 BSD Sum16 Sum24 Sum32 Sum64 Sum8 SWIFFT Tiger/128 Tiger/160 Tiger/192 Whirlpool-1 Whirlpool-2 XOR16 XOR32 XOR8 XUM 32