Synonyms
Cryptographic hash functions; One-way hash functions
Definition
A hash function h is a well-defined deterministic algorithm that takes as input data of arbitrary length and produces a short fixed-length digital representation of the data, or a digest, as its output. The output of a hash function can serve the role of a digital “fingerprint” of the input data. A cryptographic hash function is often expected to have the following security properties:
- 1.
One-way (or preimage resistance): given a hash value y, it is infeasible to find an input x that hashes to y, i.e., h(x) = y.
- 2.
Weak collision resistance (or second preimage resistance): given an input x and the corresponding digest of that input h(x), it is infeasible to find another input x′; that matches the digest, i.e., h(x) = h(x′).
- 3.
Strong collission resistance (or simply collision resistance): it is infeasible to find two different inputs x and x′; that hash to the same value, i.e., h(x) = h(x′).
The third property is...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bertoni G, Daemen J, Peeters M, Van Assche G. The Keccak sponge function family: specifications summary. http://keccak.noekeon.org/specs_summary.html
Eastlake D, Jones P. US secure hash algorithm 1 (SHA1). IETF RFC 3174 (2001). http://www.ietf.org/rfc/rfc3174.txt
National Institute of Standards and Technology (NIST). FIPS 180-4: Secure Hash Standard (SHS). 2012.
Rivest R. The MD5 message-digest algorithm. IETF RFC 1321. 1992. http://www.ietf.org/rfc/rfc1321.txt
Schneier B. Applied cryptography: protocols, algorithms, and source code. 2nd ed. New York: Wiley; 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Blanton, M. (2018). Hash Functions. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1482
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1482
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering