Hash Functions
Authors:
Open Access
- 27 April 2023
- book chapter
- Published by Springer Nature
- p. 21-24
Abstract
Hash functions are one-way functions that map arbitrary-length input to fixed-length output. Moreover, they have many cryptographic applications, such as integrity checks, password storage, and signatures. Cryptographic hash functions have some additional properties that can be formulated as hard problems: pre-image resistance, second pre-image resistance, and collision resistance. A significant technological development in this area is unlikely. Standardized hash functions are considered secure, and open-source implementations can be used at no cost. To conclude, the security properties required from hash functions depend on the intended purpose.Keywords
Funding Information
- ArmaSuisse
This publication has 5 references indexed in Scilit:
- Recommendation for key derivation using pseudorandom functions2022
- SHA-3 standard :2015
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities2007
- A fast quantum mechanical algorithm for database search1996
- Cryptographic hash functionsEuropean Transactions on Telecommunications, 1994