Abstract
AbstractHash 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.
Publisher
Springer Nature Switzerland
Reference9 articles.
1. James M Turner. The Keyed-Hash Message Authentication Code (HMAC), 2008. Federal Inf. Process. Stds. (NIST FIPS), National Institute of Standards and Technology, Gaithersburg, MD.
2. Lily Chen. Recommendation for Key Derivation Using Pseudorandom Functions, 2022. Federal Inf. Process. Stds. (NIST FIPS), National Institute of Standards and Technology, Gaithersburg, MD.
3. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
4. Bart Preneel. Cryptographic hash functions. European Transactions on Telecommunications, 5(4):431–448, 1994.
5. Crypto competitions: SHA-3: a secure hash algorithm. https://competitions.cr.yp.to/sha3.html, June 2022.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Employing Cryptographic Techniques for Data Security and Privacy Preservation;Transactions on Computer Science and Intelligent Systems Research;2024-08-12