FSUM 2.51

Fast file checksum generation & verification tool. Allows to create/verify popular file hash/checksum: MD2,MD4,MD5, SHA-1,SHA-2(256,384,512), RIPEMD-160,PANAMA,TIGER, CRC-32,ADLER32, and the message digest used in eMule/eDonkey(ed2k) software. Use it to check files for corruption (data integrity checking). Allows to recurse directories. Supports MD5 & SFV files. Compatible with md5sum, MD5Summer, Easy MD5 Creator, SFV Checker/Verifier, Win CRC32.

See also: hash, message, digest, checksum, crc, file, data, sum, 128, bit, check, checking, checker, verify, veriifying, verifier, compare, comparing, comparation, test, testing, tester, generator, download, downloads, ftp, music, video, audio, image, film, mp3, mpeg, pdf, avi, wav, doc, zip, rar

LLCryptoLib 1.3

LLCryptoLib offers encryption classes and hashing functions for text and binary files plus full shredding capabilities. Free for non commercial uses. Hashing algorithms: MD2, MD4, MD5, SHA1, SHA256, SHA384, TIGER, RIPEMD160, CRC32 Symmetric Encryption algorithms: ROT13, Playfair, PseudoDES, DES, Triple DES, Rijndael (AES), ARC4, Blowfish

See also: cryptography, hash, shred, MD5, SHA1, SHA256, BLOWFISH, AES, RIJNDAEL, DES, 3DES, GUTMANN, DOD, .NET

HashCalc 2.01

Free, fast calculator to compute hash, checksum, HMAC values for file, text and hex string. Supports popular message digest and check sum algorithms: MD2,MD4,MD5, SHA1,SHA2, RIPEMD160,PANAMA,TIGER, CRC32,ADLER32, and the hash used in eMule/eDonkey (eDonkey2000,ed2k). With this tool you can test for corruption FTP download/upload transfers, compare music,audio,video,game,image files, verify a CD, perform checking of mp3,mpeg,vcd,iso,zip downloads.

See also: hash, message, digest, checksum, crc, hmac, algorithm, file, data, sum, authentication, key, password, encryption, encrypt, 128, bit, check, checking, checker, verify, veriifying, verifier, compare, comparing, comparation, calculate, calculation, test, testing, tester, generator

HashTrie 1.0

By Softcomplete Development. HashTrie is a new highly efficient data structure for fast searching. It combines in itself properties of the hash-tables and trie (digital-trees). As against the usual hash-tables the size of HashTrie is not fixed which allows it to work with an unknown previous amount of data.

See also: hash, tree, dynamic, HashTrie