Information Theory and Hashing: An overview
Abstract:
Developed in 1946, Information Theory quickly was recognized as an important element in cryptography, due to its value in measuring the information contained in data. Information Theory allows us to evaluate cryptosystems based on the information provided by cyphertexts, allowing us to place theoretical bounds on almost any imaginable cryptosystem. This paper will present a general overview of Information Theory, as well as demonstrating its application to hashing functions.
Introduction to hashing
How's it work, what's it do, why do we need it? Why are there better hashing algorithms needed?
Slides: Click here.
Paper: Click here.
Sources:
A Mathematical Theory of Communication
The Information Theory of Perfect Hashing
New bounds for perfect hashing via information theory
Integral Distinguishers of some Sha-3 candidates
Perfect Hashing and Probability
Common Randomness in Information Theory and Cryptography
The Role of Information Theory in Cryptography
Information-Theoretic Cryptography - Ueli Maurer
Not exactly Sources:
Shannon's Theory Explained
The Laws of Cryptography: Coding and Information Theory
A Reference text for the paper