Hash trees are a generalization of hash lists and hash chains. Hash trees are used in hash-based cryptography. Linear hashing is a hash table algorithm that permits incremental hash table expansion. A MD5 hash is a 16-byte value. The passwords were encrypted using an outdated, unsalted MD5 hash. Finally, hashing directly maps keys to records based on a hash function. The manifest may optionally contain a cryptographic hash or checksum of each file. It is based on using a cryptographic hash or symmetric encryption algorithm. The security of the MD5 hash function is severely compromised. Many systems store a cryptographic hash of the password. The algorithm is well suited for implementing a resizable concurrent hash table. Each piece is protected by a cryptographic hash contained in the torrent descriptor. This implementation used a separate array for each hash function. It then computes the 160-bit SHA-1 hash of the header. This property can be used to break naive authentication schemes based on hash functions.