Cryptographic hash functions

Cryptographic hash functions
User:Jorge Stolfi based on Image:Hash_function.svg by Helix84 · Public domain · source
Name	Cryptographic hash functions
Type	Algorithm
Introduced	1970s
Designers	Merkle, Davies, Bellare, Rogaway, Schneier, Rivest
Related	Message authentication codes, Digital signatures, Public key infrastructure, Block ciphers

Cryptographic hash functions Cryptographic hash functions are deterministic algorithms that map data of arbitrary size to fixed-size outputs, used widely in National Institute of Standards and Technology, Internet Engineering Task Force, European Union Agency for Cybersecurity, RSA Security, International Organization for Standardization, U.S. Department of Defense contexts. They underpin integrity and identification tasks across systems designed by organizations such as Microsoft, Google, Apple Inc., Amazon (company), and IBM. Early research by figures associated with Xerox PARC, Bell Labs, Stanford University, Massachusetts Institute of Technology and researchers like Ralph Merkle and Ronald Rivest guided their adoption in protocols deployed by USENET, DARPA, and standards bodies including ANSI. Contemporary use spans platforms from Bitcoin and Ethereum to TLS and Secure Shell implementations maintained by OpenSSL and LibreSSL.

Definition and properties

A cryptographic hash function accepts a message input and returns a fixed-length digest; properties required by designers include preimage resistance, second-preimage resistance, and collision resistance as formalized in work associated with Shafi Goldwasser, Silvio Micali, Odlyzko, and proofs in the tradition of Goldwasser–Micali. Additional desiderata include pseudorandomness, avalanche effect, and efficiency on architectures from x86 to ARM and co-design for hardware implementations produced by Intel Corporation and Advanced Micro Devices. Security proofs often reference hardness assumptions connected to primitives studied by Manuel Blum, Adi Shamir, and Ronald Rivest; function families are judged also by compression functions, Merkle–Damgård construction credited to Ralph Merkle and Ivan Damgård, and sponge constructions associated with Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche.

History and development

Work on hashing traces from integrity checks in systems at Bell Labs and checksum research in IBM projects to formal cryptographic study in the 1970s and 1980s by researchers at MIT, Stanford University, and University of California, Berkeley. The design of MD4 and MD5 by Ronald Rivest influenced later algorithms; collision discoveries by teams led by Xiaoyun Wang and Hongbo Yu prompted deprecation of many legacy functions. The Advanced Encryption Standard process at National Institute of Standards and Technology and submissions from laboratories including NIST and cryptographers such as Vincent Rijmen and Joan Daemen shifted attention to new primitives. The SHA family evolved through contributions from NSA, NIST, and independent cryptanalytic efforts from groups at Ecole Normale Supérieure, University of Technology, Sydney, and research labs like CRYPTO and Eurocrypt conference authors.

Construction and algorithms

Major algorithm families include Merkle–Damgård-based designs such as MD5 and SHA-1, wide-pipe and HAIFA variants championed in cryptographic literature by André Karlsson and Antoon Bosselaers, and sponge-based designs exemplified by Keccak used in SHA-3 standardized by NIST. Iterated compression functions rely on block-cipher-like primitives similar to DES and AES, with structure choices influenced by designers from IBM Research and NIST. Constructions adopt techniques like Davies–Meyer, Matyas–Meyer–Oseas, and Miyaguchi–Preneel, building on theoretical frameworks taught at Princeton University and Harvard University. Performance tuning involves instruction sets implemented by ARM Limited and SIMD enhancements advocated in papers from University of California, Los Angeles and ETH Zurich.

Security notions and attacks

Security analysis covers resistance to preimage, second-preimage, and collision attacks; academic breakthroughs published at conferences like CRYPTO, EUROCRYPT, ASIACRYPT, and RSA Conference exposed weaknesses in functions including MD5 and SHA-1. Cryptanalysts such as Wang Xiaoyun, Xiaoyun Wang, Marc Stevens, Arjen Lenstra, and teams at CWI demonstrated practical collision generation, influencing protocols used by VeriSign and IETF. Attack techniques include differential cryptanalysis adapted from work by Eli Biham and Adi Shamir, length extension attacks exploited in APIs maintained by OpenSSL, and side-channel attacks studied at University of Cambridge and Technische Universität Darmstadt. Security proofs often rely on idealized models such as the random oracle model introduced by Bellare and Rogaway and reductions to hardness assumptions formalized by Shafi Goldwasser and Silvio Micali.

Applications and protocols

Hash functions appear in digital signature schemes used by RSA (cryptosystem), Digital Signature Algorithm, and Elliptic Curve Digital Signature Algorithm deployments in PGP and S/MIME; message authentication and key derivation in TLS, IPsec, SSH, and Kerberos; blockchain systems exemplified by Bitcoin and Ethereum; and timestamping and integrity services by organizations such as DigiCert and Let's Encrypt. They also serve in password hashing schemes combined with salts in systems designed by Dropbox, Facebook, and Twitter, and in key-stretching algorithms influenced by Colin Percival and Niels Provos with constructions like bcrypt and scrypt. Protocol specifications by IETF and standards by NIST and ISO govern acceptable primitives and migration paths across industries including finance anchored by SWIFT and healthcare systems regulated under laws like Health Insurance Portability and Accountability Act.

Standards and implementations

Standards bodies including NIST, ISO, IETF, and IEEE publish algorithm specifications and testing frameworks; notable standards include FIPS publications and RFC documents. Reference implementations exist in libraries from OpenSSL, LibreSSL, BoringSSL, cryptographic toolkits by GnuPG, Botan, WolfSSL, and platform-native implementations in operating systems by Microsoft Windows, Linux Foundation distributions, and Apple Inc. security stacks. Conformance testing is performed by validation programs run with participation from vendors like Cisco Systems, Oracle Corporation, and Juniper Networks; hardware acceleration features are integrated into processors from Intel Corporation and ARM Limited and into dedicated modules such as TPM and HSM devices.

Category:Cryptography