- Algorithms
- >
- Search algorithms
- >
- Hashing
- >
- Hash functions

- Applied mathematics
- >
- Algorithms
- >
- Error detection and correction
- >
- Hash functions

- Discrete mathematics
- >
- Coding theory
- >
- Error detection and correction
- >
- Hash functions

- Information theory
- >
- Coding theory
- >
- Error detection and correction
- >
- Hash functions

- Mathematical logic
- >
- Algorithms
- >
- Error detection and correction
- >
- Hash functions

- Statistical theory
- >
- Information theory
- >
- Error detection and correction
- >
- Hash functions

- Theoretical computer science
- >
- Algorithms
- >
- Error detection and correction
- >
- Hash functions

- Theoretical computer science
- >
- Information theory
- >
- Error detection and correction
- >
- Hash functions

Identicon

An Identicon is a visual representation of a hash value, usually of an IP address, that serves to identify a user of a computer system as a form of avatar while protecting the user's privacy. The orig

SimHash

In computer science, SimHash is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to find near duplicate pages. It was created by Moses Charikar.

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. It was first studied in the form of Zo

Bitstate hashing

Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. of an automaton) is represented by a number and it is passed to some hash function

Perfect hash function

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. In mathematical terms, it is an injective fun

K-independent hashing

In computer science, a family of hash functions is said to be k-independent, k-wise independent or k-universal if selecting a function at random from the family guarantees that the hash codes of any d

Hash function

A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashe

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 t

MinHash

In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was

SipHash

SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by and Daniel J. Bernstein in 2012, in response to a spate of "hash flooding" denial-of-service attacks (HashDoS) in l

Locality-preserving hashing

No description available.

Hash filter

A hash filter creates a hash sum from data, typically e-mail, and compares the sum against other previously defined sums. Depending on the purpose of the filter, the data can then be included or exclu

Shabal

Shabal is a cryptographic hash function submitted by the France-funded research project Saphir to NIST's international competition on hash functions.

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

Toeplitz Hash Algorithm

The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix. The Toeplitz Hash Algorithm is used in many netw

List of hash functions

This is a list of hash functions, including cyclic redundancy checks, checksum functions, and cryptographic hash functions.

© 2023 Useful Links.