Searches , social queries for HASH FUNCTION
Search references for HASH FUNCTION. Phrases containing HASH FUNCTION
See searches and references containing HASH FUNCTION!
Search references for HASH FUNCTION. Phrases containing HASH FUNCTION
See searches and references containing HASH FUNCTION!HASH FUNCTION
Mapping arbitrary data to fixed-size values
output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to
Hash_function
Hash function that is suitable for use in cryptography
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle
Cryptographic_hash_function
checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions". www.azillionmonkeys
List_of_hash_functions
Hash function without any collisions
In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions
Perfect_hash_function
Cryptographic hash function
JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu. Though chosen as one of the five finalists of the competition
JH_(hash_function)
Cryptographic hash function
BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants
BLAKE_(hash_function)
Associative array for storing key–value pairs
data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots
Hash_table
Cryptographic hash function
Skein is a cryptographic hash function and one of five finalists in the NIST hash function competition. Entered as a candidate to become the SHA-3 standard
Skein_(hash_function)
Function that derives secret keys from a secret value
password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch
Key_derivation_function
Family of cryptographic hash functions
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
Secure_Hash_Algorithms
Collection of hash functions
{ hash += key[i++]; hash += hash << 10; hash ^= hash >> 6; } hash += hash << 3; hash ^= hash >> 11; hash += hash << 15; return hash; } Sample hash values
Jenkins_hash_function
Tables comparing general and technical information for common hashes
hash function security/cryptanalysis can be found at hash function security summary. Basic general information about the cryptographic hash functions:
Comparison of cryptographic hash functions
Comparison_of_cryptographic_hash_functions
Cryptographic hash function
ShangMi 3 (SM3) is a cryptographic hash function, standardised for use in commercial cryptography in China. It was published by the State Cryptography
SM3_(hash_function)
Cryptographic hash function
cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function. It was designed by Vincent Rijmen (co-creator of the Advanced Encryption
Whirlpool_(hash_function)
Non-cryptographic hash function
is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo. The basis of the FNV hash algorithm was taken from
Fowler–Noll–Vo_hash_function
Obsolete cryptographic hash function
The MD2 Message-Digest Algorithm is an obsolete cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers
MD2_(hash_function)
Computer communications authentication algorithm
type of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key. As with any MAC, it may be used to simultaneously
HMAC
Computing algorithm
PJW hash function is a non-cryptographic hash function created by Peter J. Weinberger of AT&T Bell Labs. A variant of PJW hash had been used to create
PJW_hash_function
Password cracking dataset
cryptographic hash function, usually for cracking password hashes. Passwords are typically stored not in plain text form, but as hash values. If such
Rainbow_table
Technique for selecting hash functions
universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain
Universal_hashing
Hash functions intended for applications that do not need rigorous security
non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic hash functions
Non-cryptographic hash function
Non-cryptographic_hash_function
Attack model against cryptographic hash functions
attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on
Preimage_attack
Russian cryptographic hash function
The GOST hash function, defined in the standards GOST R 34.11-94 and GOST 34.311-95 is a 256-bit cryptographic hash function. It was initially defined
GOST_(hash_function)
Type of hash function
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
Rolling_hash
Cryptographic hash function
cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits
Tiger_(hash_function)
Publicly known attacks against cryptographic hash functions
cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see comparison of cryptographic hash functions
Hash function security summary
Hash_function_security_summary
Information used for message authentication and integrity checking
different hashing primitive (SHA-1 and SHA-2) then XORed together to output the MAC. Universal hashing and in particular pairwise independent hash functions provide
Message_authentication_code
Hash function phenomenon
derived from a hash function which takes a data input and returns a fixed length of bits. Hash is typically used as a many-to-one function, with the number
Hash_collision
Type of data structure
the above picture hash 0 is the result of hashing the concatenation of hash 0-0 and hash 0-1. That is, hash 0 = hash( hash 0-0 + hash 0-1 ) where "+" denotes
Merkle_tree
Message-digest hashing algorithm
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, and was
MD5
Competition to develop SHA-3
hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function
NIST hash function competition
NIST_hash_function_competition
Hash functions
to a spate of "hash flooding" denial-of-service attacks (HashDoS) in late 2011. SipHash is designed as a secure pseudorandom function and can also be
SipHash
Method of producing many one-time keys from a single key
A hash chain is the successive application of a cryptographic hash function to a piece of data. In computer security, a hash chain is a method used to
Hash_chain
Algorithmic technique using hashing
In computer science, locality-sensitive hashing (LSH) is a fuzzy hashing technique that hashes similar input items into the same "buckets" with high probability
Locality-sensitive_hashing
Random data used as an additional input to a hash function
cryptography, a salt is random data fed as an additional input to a one-way function that hashes data, a password or passphrase. Salting helps defend against attacks
Salt_(cryptography)
cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on
Security of cryptographic hash functions
Security_of_cryptographic_hash_functions
Hash collision resolution technique
quadratic function). Double hashing in which the interval between probes is fixed for each record but is computed by another hash function. The main trade
Open_addressing
Cryptographic primitive
multi-block-length hash function based on block ciphers" and typically achieves (asymptotic) rates between 1 and 2 independent of the hash size (only with
One-way_compression_function
Cryptographic hash function
Fugue is a cryptographic hash function submitted by IBM to the NIST hash function competition. It was designed by Shai Halevi, William E. Hall, and Charanjit
Fugue_(hash_function)
Cryptographic hash function
SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is
SIMD_(hash_function)
Set of cryptographic hash functions
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published
SHA-2
Measure of cryptographic strength
of the strength that a cryptographic primitive — such as a cipher or hash function — achieves. Security level is usually expressed as a number of "bits
Security_level
Cryptographic hash function
cryptography, SHA-1 (Secure Hash Algorithm 1) is a hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest
SHA-1
Cryptographic attack
faster than a brute force would be. A hash of n bits can be broken in 2n/2 time steps (evaluations of the hash function). Mathematically stated, a collision
Collision_attack
Computer function
c2 hash ← hash XOR remainingBytes hash ← hash XOR len hash ← hash XOR (hash >> 16) hash ← hash × 0x85ebca6b hash ← hash XOR (hash >> 13) hash ← hash ×
MurmurHash
Function used in computer cryptography
information, called the trapdoor, is known. A collision-free hash function f is a one-way function that is also collision-resistant; that is, no randomized
One-way_function
Set of cryptographic hash functions
function, not (yet) standardized by NIST, including a stream cipher, an authenticated encryption system, a "tree" hashing scheme for faster hashing on
SHA-3
Attack against cryptographical hash functions
hashing functions work by taking the input message, and using it to transform an internal state. After all of the input has been processed, the hash digest
Length_extension_attack
Method of building collision-resistant cryptographic hash functions
Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions from collision-resistant one-way compression functions. This
Merkle–Damgård_construction
Type of cryptographic attack
values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle
Birthday_attack
Data structure hashing scheme
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup
Cuckoo_hashing
Password-based key derivation function
bcrypt is a password-hashing function designed by Niels Provos and David Mazières. It is based on the Blowfish cipher and presented at USENIX in 1999.
Bcrypt
Algorithm used in relational databases
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. All variants of hash join
Hash_join
Mathematical object
hash functions that can be proven secure based on worst case hardness of the shortest vector problem for ideal lattices. They defined hash function families
Ideal_lattice
System for dealing with email spam
email postmark are that postmark hashes the body in addition to the recipient, uses a modified SHA-1 as the hash function, and uses multiple sub-puzzles
Hashcash
Key derivation function based on an HMAC
underlying extractor hash function, if not provided) and the I K M {\displaystyle \mathrm {IKM} } as the message. The underlying hash function used for HKDF-Extract
HKDF
Techniques to protect against brute-force attack
ways to perform key stretching. One way is to apply a cryptographic hash function or a block cipher repeatedly in a loop. For example, in applications
Key_stretching
Cryptographic hash function
cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions. The research
Shabal
Computer programming method for hashing
position given by the hash function, until finding a cell with a matching key or an empty cell. As Thorup & Zhang (2012) write, "Hash tables are the most
Linear_probing
Theory of cryptography
cryptographic primitives, including cryptographic hashes, message authentication codes, mask generation functions, stream ciphers, pseudo-random number generators
Sponge_function
Cryptographic hash function
Lane is a cryptographic hash function submitted to the NIST hash function competition; it was designed by Sebastiaan Indesteege with contributions by
Lane_(hash_function)
Property of cryptographic hash functions
property of cryptographic hash functions (CHFs): a hash function H is collision-resistant if it is hard to find two inputs that hash to the same output; that
Collision_resistance
Russian cryptographic hash function
hash function defined in the Russian national standard GOST R 34.11-2012 Information Technology – Cryptographic Information Security – Hash Function.
Streebog
One-way cryptographic tool
In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute
Trapdoor_function
Cryptographic hash function
LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart
LSH_(hash_function)
Practice and study of secure communication techniques
a cryptographic hash function is computed, and only the resulting hash is digitally signed. Cryptographic hash functions are functions that take a variable-length
Cryptography
Fast 8-bit hash function
Pearson hashing is a non-cryptographic hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number
Pearson_hashing
Hashing technique
In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys
Consistent_hashing
Vectorizing features using a hash function
indices in a vector or matrix. It works by applying a hash function to the features and using their hash values as indices directly (after a modulo operation)
Feature_hashing
Concept in cryptography
Hash-based cryptography is the generic term for constructions of cryptographic primitives based on the security of hash functions. It is of interest as
Hash-based_cryptography
2015 password-based key derivation function
Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel
Argon2
Data structure for approximate set membership
different bit-fields of such a hash, so this type of hash can be used to generate multiple "different" hash functions by slicing its output into multiple
Bloom_filter
Concept in cryptography
cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping a single
Avalanche_effect
Key derivation function
published in 2017, recommends PBKDF2 for password hashing. PBKDF2 applies a pseudorandom function, such as hash-based message authentication code (HMAC), to
PBKDF2
Class of fingerprinting algorithm
Azadeh Amir Asgari published work on robust image hash spoofing. Asgari notes that perceptual hash function like any other algorithm is prone to errors. Researchers
Perceptual_hashing
Cryptographic hash function
Quark is a cryptographic hash function (family). It was designed by Jean-Philippe Aumasson, Luca Henzen, Willi Meier and María Naya-Plasencia. Quark was
Quark_(hash_function)
String searching algorithm
rolling hash. A rolling hash is a hash function specially designed to enable this operation. A trivial (but not very good) rolling hash function just adds
Rabin–Karp_algorithm
Cryptographic secret, not public in contrast to salt
password during hashing with a cryptographic hash function. This value differs from a salt in that it is not stored alongside a password hash, but rather
Pepper_(cryptography)
Block cipher
tweakable block cipher designed as part of the Skein hash function, an entry in the NIST hash function competition. Threefish uses no S-boxes or other table
Threefish
Collection of efficiently-computable functions which emulate a random oracle
for: dynamic perfect hashing; even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the previous
Pseudorandom_function_family
List of data hashes
file). A hash list is a subtree of a Merkle tree. Often, an additional hash of the hash list itself (a top hash, also called root hash or master hash) is used
Hash_list
Data mining technique
to compute multiple hash functions, but a related version of MinHash scheme avoids this penalty by using only a single hash function and uses it to select
MinHash
System that regulates the formation of blocks on a blockchain
increasing reliance on specialized hardware, Litecoin changed the Hashcash hash function from SHA-256 to Scrypt. Developed by Colin Percival and detailed in
Proof_of_work
Authenticated encryption mode for block ciphers
C)=X_{m+n+1}} , where H = E k ( 0 128 ) {\displaystyle H=E_{k}(0^{128})} is the hash key, a string of 128 zero bits encrypted using the block cipher; A {\displaystyle
Galois/Counter_Mode
Hash function construction used in computer programs that play abstract board games
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract
Zobrist_hashing
Hash functions computed by exclusive or
In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or
Tabulation_hashing
Array that replaces runtime computation with a simpler array indexing operation
the slot h ( k ) {\displaystyle h(k)} where h {\displaystyle h} is a hash function i.e. k {\displaystyle k} is used to compute the slot, while in the case
Lookup_table
cryptography a universal one-way hash function (UOWHF, often pronounced "woof") is a type of universal hash function of particular importance to cryptography
Universal one-way hash function
Universal_one-way_hash_function
Algorithm
and disruption is minimal. Rendezvous hashing has the following properties: Low overhead: The hash function used is efficient, so overhead at the clients
Rendezvous_hashing
Group of class templates in the C++ Standard Library
myPointToIntMap; Or can be set as the default hash function by specializing std::hash: namespace std { template <> class hash<Vector3> { public: size_t operator()(const
Unordered associative containers (C++)
Unordered_associative_containers_(C++)
Study of analyzing information systems in order to discover their hidden aspects
against weakened versions of a cryptosystem, such as a block cipher or hash function with some rounds removed. Many, but not all, attacks become exponentially
Cryptanalysis
Topics referred to by the same term
Look up hash in Wiktionary, the free dictionary. Hash, hashes, hash mark, or hashing may refer to: Hash (food), a coarse mixture of ingredients, often
Hash
Block ciphers
Anderson and Eli Biham by combining a stream cipher and a cryptographic hash function. The algorithms use a very large variable block size, on the order of
BEAR_and_LION_ciphers
recommendation. Anubis – 128-bit block BEAR – built from a stream cypher and hash function, by Ross Anderson Blowfish – 64-bit block; by Bruce Schneier et al.
Outline_of_cryptography
Single-use value in secure communications
Nonces can also be useful as initialization vectors and in cryptographic hash functions. A nonce is an arbitrary number used only once in a cryptographic communication
Cryptographic_nonce
Cryptography secured against quantum computers
needed] and there exist many non-patented hash functions that could be used with these schemes. The stateful hash-based signature scheme XMSS developed by
Post-quantum_cryptography
Mathematical scheme for verifying the authenticity of digital documents
trapdoor function. This forgery attack, then, only produces the padded hash function output that corresponds to σ, but not a message that leads to that value
Digital_signature
Scheme often used with RSA encryption
the mask generating function, usually MGF1, Hash is the chosen hash function, hLen is the length of the output of the hash function in bytes, k is the
Optimal asymmetric encryption padding
Optimal_asymmetric_encryption_padding
Cryptographic primitives that involve lattices
solve as a worst-case lattice problem. She then showed a cryptographic hash function whose security is equivalent to the computational hardness of SIS. In
Lattice-based_cryptography
perfect hash function. Using a minimum perfect hash function gives a big space improvement if the associated values are relatively small. Hashed filters
Retrieval_Data_Structure
travel, tourism, insurance
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
HASH FUNCTION
travel, tourism, insurance