family of hash functions

См. также в других словарях:

• SHA 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

• The Hash Function Hamsi — Содержание 1 Краткое описание 2 История 3 The Hash Funtion Hamsi 3.1 Общая структу …   Википедия

• NIST hash function competition — Cryptography portal The NIST hash function competition is an open competition held by the US National Institute of Standards and Technology for a new SHA 3 function to replace the older SHA 1 and SHA 2, which was formally announced in the Federal …   Wikipedia

• Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… …   Wikipedia

• Secure Hash Algorithm 2 — SHA 2 (англ. Secure Hash Algorithm Version 2  безопасный алгоритм хеширования, версия 2)  собирательное название однонаправленных хеш функций SHA 224, SHA 256, SHA 384 и SHA 512. Хеш функции предназначены для создания «отпечатков» или… …   Википедия

• Locality sensitive hashing — (LSH) is a method of performing probabilistic dimension reduction of high dimensional data. The basic idea is to hash the input items so that similar items are mapped to the same buckets with high probability (the number of buckets being much… …   Wikipedia

• Universal hashing — is a randomized algorithm for selecting a hash function F with the following property: for any two distinct inputs x and y , the probability that F(x)=F(y) (i.e., that there is a hash collision between x and y ) is the same as if F was a random… …   Wikipedia

• Color-coding — For other uses, see Color code. In computer science and graph theory, the method of color coding[1][2] efficiently finds k vertex simple paths, k vertex cycles, and other small subgraphs within a given graph using probabilistic algorithms, which… …   Wikipedia

• MD5 — General Designers Ronald Rivest First published April 1992 Series MD2, MD4, MD5, MD6 Detail Digest sizes 128 bits …   Wikipedia

• IP traceback — is a name given to any method for reliably determining the origin of a packet on the Internet. The datagram nature of the Internet makes it difficult to determine the originating host of a packet – the source id supplied in an IP packet can be… …   Wikipedia

• CityHash — This article is about the family of hash functions. For the running club, see Hash House Harriers. CityHash is a family of non cryptographic hash functions, designed for fast hashing of strings. It has 64 , 128 , and 256 bit variants. Google… …   Wikipedia