enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. List of hash functions - Wikipedia

    en.wikipedia.org/wiki/List_of_hash_functions

    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 function) RadioGatún: arbitrary ideal mangling ...

  3. Perfect hash function - Wikipedia

    en.wikipedia.org/wiki/Perfect_hash_function

    A hash function is k-perfect if at most k elements from S are mapped onto the same value in the range. The "hash, displace, and compress" algorithm can be used to construct k-perfect hash functions by allowing up to k collisions. The changes necessary to accomplish this are minimal, and are underlined in the adapted pseudocode below:

  4. Comparison of cryptographic hash functions - Wikipedia

    en.wikipedia.org/wiki/Comparison_of...

    The following tables compare general and technical information for a number of cryptographic hash functions. See the individual functions' articles for further information. This article is not all-inclusive or necessarily up-to-date. An overview of hash function security/cryptanalysis can be found at hash function security summary.

  5. Secure Hash Algorithms - Wikipedia

    en.wikipedia.org/wiki/Secure_Hash_Algorithms

    The Secure Hash Algorithms are a family of cryptographic hash functions published by the National Institute of Standards and Technology (NIST) as a U.S. Federal Information Processing Standard (FIPS), including: SHA-0: A retronym applied to the original version of the 160-bit hash function published in 1993 under the name "SHA". It was ...

  6. Cryptographic hash function - Wikipedia

    en.wikipedia.org/wiki/Cryptographic_hash_function

    SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA), first published in 2001. They are built using the Merkle–Damgård structure, from a one-way compression function itself built using the Davies–Meyer structure from a (classified) specialized block cipher.

  7. Fowler–Noll–Vo hash function - Wikipedia

    en.wikipedia.org/wiki/Fowler–Noll–Vo_hash...

    The FNV hash was designed for fast hash table and checksum use, not cryptography. The authors have identified the following properties as making the algorithm unsuitable as a cryptographic hash function: [16] Speed of computation – As a hash designed primarily for hashtable and checksum use, FNV-1 and FNV-1a were designed to be fast to ...

  8. Rolling hash - Wikipedia

    en.wikipedia.org/wiki/Rolling_hash

    A rolling hash (also known as recursive hashing or rolling checksum) is a hash function where the input is hashed in a window that moves through the input.. A few hash functions allow a rolling hash to be computed very quickly—the new hash value is rapidly calculated given only the old hash value, the old value removed from the window, and the new value added to the window—similar to the ...

  9. SWIFFT - Wikipedia

    en.wikipedia.org/wiki/SWIFFT

    By giving a security reduction to the worst-case scenario of a difficult mathematical problem, SWIFFT gives a much stronger security guarantee than most other cryptographic hash functions. Unlike many other provably secure hash functions, the algorithm is quite fast, yielding a throughput of 40 Mbit/s on a 3.2 GHz Intel Pentium 4.