Faster access than browser!
65 relations: Adler-32, Binary operation, BLAKE (hash function), BSD checksum, Checksum, Cryptographic hash function, Cyclic redundancy check, Damm algorithm, Elliptic curve only hash, Fast syndrome-based hash, Fletcher's checksum, Fowler–Noll–Vo hash function, GOST (hash function), Grøstl, HAS-160, Hash function, Hash function security summary, HAVAL, HighwayHash, HMAC, Java hashCode(), Jenkins hash function, JH (hash function), Longitudinal redundancy check, Luhn algorithm, LZ4 (compression algorithm), MD2 (cryptography), MD4, MD5, MD6, Merkle tree, Merkle–Damgård construction, MurmurHash, NIST hash function competition, Nonlinear-feedback shift register, One-key MAC, Pearson hashing, PJW hash function, PMAC (cryptography), Poly1305, Quasigroup, Rabin fingerprint, RadioGatún, RIPEMD, SHA-1, SHA-2, SHA-3, SipHash, Skein (hash function), Snefru, ..., Spectral Hash, Sponge function, Streebog, Sum (Unix), SWIFFT, SYSV checksum, Tabulation hashing, Tiger (cryptography), UMAC, Universal one-way hash function, Verhoeff algorithm, VMAC, Whirlpool (cryptography), Xorshift, Zobrist hashing. Expand index (15 more) »
Adler-32
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995, and is a modification of the Fletcher checksum.
New!!: List of hash functions and Adler-32 · See more »
Binary operation
In mathematics, a binary operation on a set is a calculation that combines two elements of the set (called operands) to produce another element of the set.
New!!: List of hash functions and Binary operation · See more »
BLAKE (hash function)
BLAKE and BLAKE2 are cryptographic hash functions based on Dan Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with some round constants, is added before each ChaCha round.
New!!: List of hash functions and BLAKE (hash function) · See more »
BSD checksum
The BSD checksum algorithm is a commonly used, legacy checksum algorithm.
New!!: List of hash functions and BSD checksum · See more »
Checksum
A checksum is a small-sized datum derived from a block of digital data for the purpose of detecting errors which may have been introduced during its transmission or storage.
New!!: List of hash functions and Checksum · See more »
Cryptographic hash function
A cryptographic hash function is a special class of hash function that has certain properties which make it suitable for use in cryptography.
New!!: List of hash functions and Cryptographic hash function · See more »
Cyclic redundancy check
A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
New!!: List of hash functions and Cyclic redundancy check · See more »
Damm algorithm
In error detection, the Damm algorithm is a check digit algorithm that detects all single-digit errors and all adjacent transposition errors.
New!!: List of hash functions and Damm algorithm · See more »
Elliptic curve only hash
The elliptic curve only hash (ECOH) algorithm was submitted as a candidate for SHA-3 in the NIST hash function competition.
New!!: List of hash functions and Elliptic curve only hash · See more »
Fast syndrome-based hash
In cryptography, the fast syndrome-based hash functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.
New!!: List of hash functions and Fast syndrome-based hash · See more »
Fletcher's checksum
The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John G. Fletcher (1934–2012) at Lawrence Livermore Labs in the late 1970s.
New!!: List of hash functions and Fletcher's checksum · See more »
Fowler–Noll–Vo hash function
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo.
New!!: List of hash functions and Fowler–Noll–Vo hash function · See more »
GOST (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.
New!!: List of hash functions and GOST (hash function) · See more »
Grøstl
Grøstl is a cryptographic hash function submitted to the NIST hash function competition by Praveen Gauravaram, Lars Knudsen, Krystian Matusiewicz, Florian Mendel, Christian Rechberger, Martin Schläffer, and Søren S. Thomsen.
New!!: List of hash functions and Grøstl · See more »
HAS-160
HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm.
New!!: List of hash functions and HAS-160 · See more »
Hash function
A hash function is any function that can be used to map data of arbitrary size to data of a fixed size.
New!!: List of hash functions and Hash function · See more »
Hash function security summary
This article summarizes publicly known attacks against cryptographic hash functions.
New!!: List of hash functions and Hash function security summary · See more »
HAVAL
HAVAL is a cryptographic hash function.
New!!: List of hash functions and HAVAL · See more »
HighwayHash
HighwayHash is a fast keyed hash/pseudorandom function developed by Jyrki Alakuijala and Jan Wassenberg.
New!!: List of hash functions and HighwayHash · See more »
HMAC
In cryptography, an HMAC (sometimes disabbreviated as either keyed-hash message authentication code or hash-based message authentication code) is a specific type of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key.
New!!: List of hash functions and HMAC · See more »
Java hashCode()
In the Java programming language, every class implicitly or explicitly provides a hashCode() method, which digests the data stored in an instance of the class into a single hash value (a 32-bit signed integer).
New!!: List of hash functions and Java hashCode() · See more »
Jenkins hash function
The Jenkins hash functions are a collection of (non-cryptographic) hash functions for multi-byte keys designed by Bob Jenkins.
New!!: List of hash functions and Jenkins hash function · See more »
JH (hash function)
JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu.
New!!: List of hash functions and JH (hash function) · See more »
Longitudinal redundancy check
In telecommunication, a longitudinal redundancy check (LRC), or horizontal redundancy check, is a form of redundancy check that is applied independently to each of a parallel group of bit streams.
New!!: List of hash functions and Longitudinal redundancy check · See more »
Luhn algorithm
The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier numbers in the United States, Canadian Social Insurance Numbers, Israel ID Numbers and Greek Social Security Numbers (ΑΜΚΑ).
New!!: List of hash functions and Luhn algorithm · See more »
LZ4 (compression algorithm)
LZ4 is a lossless data compression algorithm that is focused on compression and decompression speed.
New!!: List of hash functions and LZ4 (compression algorithm) · See more »
MD2 (cryptography)
The MD2 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1989.
New!!: List of hash functions and MD2 (cryptography) · See more »
MD4
The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990.
New!!: List of hash functions and MD4 · See more »
MD5
The MD5 algorithm is a widely used hash function producing a 128-bit hash value.
New!!: List of hash functions and MD5 · See more »
MD6
The MD6 Message-Digest Algorithm is a cryptographic hash function.
New!!: List of hash functions and MD6 · See more »
Merkle tree
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every leaf node is labelled with the hash of a data block and every non-leaf node is labelled with the cryptographic hash of the labels of its child nodes.
New!!: List of hash functions and Merkle tree · See more »
Merkle–Damgård construction
In cryptography, the Merkle–Damgård construction or Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash functions from collision-resistant one-way compression functions.
New!!: List of hash functions and Merkle–Damgård construction · See more »
MurmurHash
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup.
New!!: List of hash functions and MurmurHash · See more »
NIST hash function competition
The NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function called SHA-3 to complement the older SHA-1 and SHA-2.
New!!: List of hash functions and NIST hash function competition · See more »
Nonlinear-feedback shift register
A nonlinear-feedback shift register (NLFSR) is a shift register whose input bit is a non-linear function of its previous state.
New!!: List of hash functions and Nonlinear-feedback shift register · See more »
One-key MAC
OMAC (One-key MAC) is a message authentication code constructed from a block cipher much like the CBC-MAC algorithm.
New!!: List of hash functions and One-key MAC · See more »
Pearson hashing
Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
New!!: List of hash functions and Pearson hashing · See more »
PJW hash function
PJW hash function is a non-cryptographic hash function created by Peter J. Weinberger of AT&T Bell Labs.
New!!: List of hash functions and PJW hash function · See more »
PMAC (cryptography)
PMAC, which stands for Parallelizable MAC, is a message authentication code algorithm.
New!!: List of hash functions and PMAC (cryptography) · See more »
Poly1305
Poly1305 is a cryptographic message authentication code (MAC) created by Daniel J. Bernstein.
New!!: List of hash functions and Poly1305 · See more »
Quasigroup
In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that "division" is always possible.
New!!: List of hash functions and Quasigroup · See more »
Rabin fingerprint
The Rabin fingerprinting scheme is a method for implementing fingerprints using polynomials over a finite field.
New!!: List of hash functions and Rabin fingerprint · See more »
RadioGatún
RadioGatún is a cryptographic hash primitive created by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche.
New!!: List of hash functions and RadioGatún · See more »
RIPEMD
RIPEMD (RACE Integrity Primitives Evaluation Message Digest) is a family of cryptographic hash functions developed in Leuven, Belgium, by Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven, and first published in 1996.
New!!: List of hash functions and RIPEMD · See more »
SHA-1
In cryptography, SHA-1 (Secure Hash Algorithm 1) is a cryptographic hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest - typically rendered as a hexadecimal number, 40 digits long.
New!!: List of hash functions and SHA-1 · See more »
SHA-2
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA).
New!!: List of hash functions and SHA-2 · See more »
SHA-3
SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015.
New!!: List of hash functions and SHA-3 · See more »
SipHash
SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by Jean-Philippe Aumasson and Daniel J. Bernstein in 2012, in response to a spate of "hash flooding" denial-of-service attacks in late 2011.
New!!: List of hash functions and SipHash · See more »
Skein (hash function)
Skein is a cryptographic hash function and one of five finalists in the NIST hash function competition.
New!!: List of hash functions and Skein (hash function) · See more »
Snefru
Snefru is a cryptographic hash function invented by Ralph Merkle in 1990 while working at Xerox PARC.
New!!: List of hash functions and Snefru · See more »
Spectral Hash
Spectral Hash is a cryptographic hash function submitted to the NIST hash function competition by Gokay Saldamlı, Cevahir Demirkıran, Megan Maguire, Carl Minden, Jacob Topper, Alex Troesch, Cody Walker, Çetin Kaya Koç.
New!!: List of hash functions and Spectral Hash · See more »
Sponge function
In cryptography, a sponge function or sponge construction is a class of algorithms with finite internal state that take an input bit stream of any length and produce an output bit stream of any desired length.
New!!: List of hash functions and Sponge function · See more »
Streebog
Streebog is a cryptographic hash function defined in the Russian national standard GOST R 34.11-2012 Information Technology – Cryptographic Information Security – Hash Function.
New!!: List of hash functions and Streebog · See more »
Sum (Unix)
Sum is a core Unix utility available on all Unix and Linux distributions.
New!!: List of hash functions and Sum (Unix) · See more »
SWIFFT
In cryptography, SWIFFT is a collection of provably secure hash functions.
New!!: List of hash functions and SWIFFT · See more »
SYSV checksum
The SYSV checksum algorithm is a commonly used, legacy checksum algorithm.
New!!: List of hash functions and SYSV checksum · See more »
Tabulation hashing
In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or operations.
New!!: List of hash functions and Tabulation hashing · See more »
Tiger (cryptography)
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms.
New!!: List of hash functions and Tiger (cryptography) · See more »
UMAC
In cryptography, a message authentication code based on universal hashing, or UMAC, is a type of message authentication code (MAC) calculated choosing a hash function from a class of hash functions according to some secret (random) process and applying it to the message.
New!!: List of hash functions and UMAC · See more »
Universal one-way hash function
In cryptography a universal one-way hash function (UOWHF, often pronounced "woof"), is a type of universal hash function of particular importance to cryptography.
New!!: List of hash functions and Universal one-way hash function · See more »
Verhoeff algorithm
The Verhoeff algorithm is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and was first published in 1969.
New!!: List of hash functions and Verhoeff algorithm · See more »
VMAC
VMAC is a block cipher-based message authentication code (MAC) algorithm using a universal hash proposed by Ted Krovetz and Wei Dai in April 2007.
New!!: List of hash functions and VMAC · See more »
Whirlpool (cryptography)
In computer science and cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function.
New!!: List of hash functions and Whirlpool (cryptography) · See more »
Xorshift
Xorshift random number generators are a class of pseudorandom number generators that were discovered by George Marsaglia.
New!!: List of hash functions and Xorshift · See more »
Zobrist hashing
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures) is a hash function construction used in computer programs that play abstract board games, such as chess and Go, to implement transposition tables, a special kind of hash table that is indexed by a board position and used to avoid analyzing the same position more than once.
New!!: List of hash functions and Zobrist hashing · See more »
Redirects here:
City Hash, City hash, City.cc, CityHash, CityHash128, CityHash64, Cityhash, List checksum, List hashes, List of checksum, List of checksum algorithms, List of checksums, List of hashes, Non-cryptographic hash functions.
References
[1] https://en.wikipedia.org/wiki/List_of_hash_functions
