World Library  
Flag as Inappropriate
Email this Article

List of hash functions

Article Id: WHEBN0002155690
Reproduction Date:

Title: List of hash functions  
Author: World Heritage Encyclopedia
Language: English
Subject: Hash functions, GOST (hash function), Adler-32, Tiger (cryptography), Checksum
Collection: Checksum Algorithms, Cryptography Lists and Comparisons, Hash Functions
Publisher: World Heritage Encyclopedia
Publication
Date:
 

List of hash functions

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

Contents

  • Cyclic redundancy checks 1
  • Checksums 2
  • Non-cryptographic hash functions 3
  • Cryptographic hash functions 4
  • See also 5
  • Notes 6

Cyclic redundancy checks

Name Length Type
BSD checksum 16 bits CRC
checksum 32 bits CRC
crc16 16 bits CRC
crc32 32 bits CRC
crc32 mpeg2 32 bits CRC
crc64 64 bits CRC
SYSV checksum 16 bits CRC

Adler-32 is often classified as a CRC, but it uses a different algorithm.

Checksums

Name Length Type
sum (Unix) 16 or 32 bits sum
sum8 8 bits sum
sum16 16 bits sum
sum24 24 bits sum
sum32 32 bits sum
fletcher-4 4 bits sum
fletcher-8 8 bits sum
fletcher-16 16 bits sum
fletcher-32 32 bits sum
Adler-32 32 bits sum
xor8 8 bits sum
Luhn algorithm 4 bits sum
Verhoeff algorithm 4 bits sum
Damm algorithm 1 decimal digit Quasigroup operation

Non-cryptographic hash functions

Name Length Type
Pearson hashing 8 bits xor/table
Buzhash variable xor/table
Fowler–Noll–Vo hash function
(FNV Hash)
32, 64, 128, 256,
512, or 1024 bits
xor/product or
product/xor
Zobrist hashing variable xor
Jenkins hash function 32 or 64 bits xor/addition
Java hashCode() 32 bits
Bernstein hash[1] 32 bits
elf64 64 bits hash
MurmurHash 32, 64, or 128 bits product/rotation
SpookyHash 32, 64 or 128 bits see Jenkins hash function
CityHash 64, 128, or 256 bits
nhash [2] variable Division/Modulo
xxHash [3] 32, 64 bits

Cryptographic hash functions

Name Length Type
BLAKE-256 256 bits HAIFA structure[4]
BLAKE-512 512 bits HAIFA structure[4]
ECOH 224 to 512 bits hash
FSB 160 to 512 bits hash
GOST 256 bits hash
Grøstl 256 to 512 bits hash
HAS-160 160 bits hash
HAVAL 128 to 256 bits hash
JH 512 bits hash
MD2 128 bits hash
MD4 128 bits hash
MD5 128 bits Merkle-Damgård construction
MD6 512 bits Merkle tree NLFSR
RadioGatún Up to 1216 bits hash
RIPEMD 128 bits hash
RIPEMD-128 128 bits hash
RIPEMD-160 160 bits hash
RIPEMD-320 320 bits hash
SHA-1 160 bits Merkle-Damgård construction
SHA-224 224 bits Merkle-Damgård construction
SHA-256 256 bits Merkle-Damgård construction
SHA-384 384 bits Merkle-Damgård construction
SHA-512 512 bits Merkle-Damgård construction
SHA-3 (originally known as Keccak) arbitrary Sponge function
Skein arbitrary Unique Block Iteration
SipHash 64 bits non-collision-resistant PRF
Snefru 128 or 256 bits hash
Spectral Hash 512 bits Wide Pipe Merkle-Damgård construction
SWIFFT 512 bits hash
Tiger 192 bits Merkle-Damgård construction
Whirlpool 512 bits hash

See also

Notes

  1. ^ http://www.cse.yorku.ca/~oz/hash.html
  2. ^ Perl code at top half of page, English text at bottom half
  3. ^ https://code.google.com/p/xxhash/
  4. ^ a b Eli Biham and Orr Dunkelman (20 July 2007). "A Framework for Iterative Hash Functions - HAIFA". 
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.