hash-function

  • 31Hash array mapped trie — A hash array mapped trie [Bagwell, P. (2001) [http://lampwww.epfl.ch/papers/idealhashtrees.pdf Ideal Hash Trees] . Technical Report, 2001.] (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and… …

    Wikipedia

  • 32One-way compression function — In cryptography, a one way compression function is a function that transforms two fixed length inputs to an output of the same size as one of the inputs. The transformation is one way , meaning that it is difficult given a particular output to… …

    Wikipedia

  • 33SHA hash functions — The SHA hash functions are a set of cryptographic hash functions designed by the National Security Agency (NSA) and published by the NIST as a U.S. Federal Information Processing Standard. SHA stands for Secure Hash Algorithm. The five algorithms …

    Wikipedia

  • 34Comparison of cryptographic hash functions — The following tables compare general and technical information for a number of cryptographic hash functions.[1] Contents 1 General information 1.1 Notes 2 Compression function …

    Wikipedia

  • 35N-Hash — In cryptography, N Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al.; weaknesses were published the following year. N Hash has a 128 bit hash size.… …

    Wikipedia

  • 36One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… …

    Wikipedia

  • 37LM hash — Lanman redirects here. For other uses, see Lanman (disambiguation). LM hash, LanMan, or LAN Manager hash was the primary hash that Microsoft LAN Manager and Microsoft Windows versions prior to Windows NT used to store user passwords. Support for… …

    Wikipedia

  • 38Rolling hash — A rolling hash 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 …

    Wikipedia

  • 39Kryptologische Hash-Funktion — Eine kryptologische Hashfunktion ist eine spezielle Hashfunktion mit weiteren Eigenschaften. Eine kryptologische Hashfunktion sollte zumindest eine Einwegfunktion sein. Eine Hashfunktion ist eine Funktion, die eine Zeichenfolge beliebiger Länge… …

    Deutsch Wikipedia

  • 40N-Hash — Криптографическая хеш функция Название N Hash Создан 1990 Опубликован 1990 Размер хеша 128 бит Число раундов 12 или 15 Тип хеш функция N Hash  криптографическая …

    Википедия