Abstract
For computer engineers, data such as text documents, music files and video files are just series of bits, being either zero or one. Such sequences can be mixed, merged and compressed into bit sequences of fixed length, and we say that the bit sequence is hashed. Hashing algorithms map files of different lengths onto bit sequences of the same length, and they can help to identify original files.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schindelhauer, C. (2011). Hashing. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)