Abstract
In this chapter we reviewed the basic definitions of hash functions. We presented several classifications for hash functions. The first classification divides the proposed hashed functions according to their level of security. In this classification they are divided into weak and strong one-way hash functions. The second classification was more concerned with the technical issue of whether a private key was involved in the scheme or not. The third classification was concerned with the structure of the hashing algorithm itself, and it considered whether a block cipher had been applied as the underlying one-way function. We reviewed various proposals, and divided them according to the third classification.
Although this chapter does not cover all the proposals, whether based on a block cipher or on other one-way functions, it gives a representative overview of the type of proposals and the problems associated with them. At the end, we remark that our aim is to develop some design rules for the construction of hash functions where they are considered as block-cipher-based and non block-cipher-based.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1993). Overview of hash functions. In: Pieprzyk, J., Sadeghiyan, B. (eds) Design of Hashing Algorithms. Lecture Notes in Computer Science, vol 756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57500-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-57500-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57500-9
Online ISBN: 978-3-540-48198-0
eBook Packages: Springer Book Archive