enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. MD5 - Wikipedia

    en.wikipedia.org/wiki/MD5

    The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value. MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, [3] and was specified in 1992 as RFC 1321. MD5 can be used as a checksum to verify data integrity against unintentional corruption.

  3. md5sum - Wikipedia

    en.wikipedia.org/wiki/Md5sum

    md5sum is a computer program that calculates and verifies 128-bit MD5 hashes, as described in RFC 1321. The MD5 hash functions as a compact digital fingerprint of a file. As with all such hashing algorithms, there is theoretically an unlimited number of files that will have any given MD5 hash.

  4. File verification - Wikipedia

    en.wikipedia.org/wiki/File_verification

    The particular hash algorithm used is often indicated by the file extension of the checksum file. The ".sha1" file extension indicates a checksum file containing 160-bit SHA-1 hashes in sha1sum format. The ".md5" file extension, or a file named "MD5SUMS", indicates a checksum file containing 128-bit MD5 hashes in md5sum format.

  5. List of hash functions - Wikipedia

    en.wikipedia.org/wiki/List_of_hash_functions

    hash GOST: 256 bits hash Grøstl: up to 512 bits hash HAS-160: 160 bits hash HAVAL: 128 to 256 bits hash JH: 224 to 512 bits hash LSH [19] 256 to 512 bits wide-pipe Merkle–Damgård construction: MD2: 128 bits hash MD4: 128 bits hash MD5: 128 bits Merkle–Damgård construction: MD6: up to 512 bits Merkle tree NLFSR (it is also a keyed hash ...

  6. Hash collision - Wikipedia

    en.wikipedia.org/wiki/Hash_collision

    John Smith and Sandra Dee share the same hash value of 02, causing a hash collision. In computer science, a hash collision or hash clash [1] is when two distinct pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits. [2]

  7. Simple file verification - Wikipedia

    en.wikipedia.org/wiki/Simple_file_verification

    However, the probability of a corrupted file having the same checksum as its original is exceedingly small, unless deliberately constructed to maintain the checksum.) SFV cannot be used to verify the authenticity of files, as CRC32 is not a collision resistant hash function; even if the hash sum file is not tampered with, it is computationally ...

  8. Checksum - Wikipedia

    en.wikipedia.org/wiki/Checksum

    This is especially true of cryptographic hash functions, which may be used to detect many data corruption errors and verify overall data integrity; if the computed checksum for the current data input matches the stored value of a previously computed checksum, there is a very high probability the data has not been accidentally altered or corrupted.

  9. Digest access authentication - Wikipedia

    en.wikipedia.org/wiki/Digest_access_authentication

    An MD5 hash is a 16-byte value. The HA1 and HA2 values used in the computation of the response are the hexadecimal representation (in lowercase) of the MD5 hashes respectively. RFC 2069 was later replaced by RFC 2617 (HTTP Authentication: Basic and Digest Access Authentication).