May 14, 2024
3 minute read
Hashing functions are mathematical functions that convert a large set of data into a smaller, fixed-size set of data, known as a hash. The hash value is a condensed representation of the input data, and it is used to quickly identify and retrieve data from a large database. Hashing functions are widely used in various applications, including cryptography, data structures, and network security.
Why Learn Hashing Functions?
There are several reasons why you may want to learn about hashing functions:
hls4l5|
Find a path to becoming a Hashing Functions. Learn more at:
OpenCourser.com/topic/hls4l5/hashing
Reading list
We've selected eight books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Hashing Functions.
This comprehensive textbook provides a thorough overview of hashing functions and their applications in data structures, including hash tables and bloom filters. It covers both theoretical concepts and practical implementation techniques.
This widely-used textbook covers a wide range of topics in cryptography and network security, including hashing functions and their role in digital signatures, message authentication codes, and other security protocols.
This authoritative reference work provides a comprehensive overview of applied cryptography, including chapters on hashing functions, digital signatures, and other cryptographic algorithms.
This classic textbook includes a detailed discussion of hashing functions in the context of sorting and searching algorithms. It provides a deep understanding of the practical and theoretical aspects of hashing.
Provides a mathematical and theoretical foundation for hashing functions, focusing on their analysis and design. It covers topics such as collision probabilities, perfect hashing, and universal hashing.
Includes a chapter on hashing functions and their applications in cryptography. It provides a practical understanding of how hashing is used to ensure data integrity and authenticity.
Provides a hands-on introduction to cryptography, including a chapter on hashing functions. It includes code examples in C to demonstrate the practical implementation of hashing algorithms.
This lecture note provides a concise overview of hashing functions and their applications in computer science, covering topics such as bloom filters and locality-sensitive hashing.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/hls4l5/hashing
Save
