can anyone explain to me the basics of hashing? I just dont get it reading the books.
Basically an hash function is a mapping between two set of values with the second set generally smaller than the first.
Given an input value should be computationally easy to calculate the hash value for that input.
Conversely it should be computationally difficult to find an input value that's mapped to a given hash value.
Hash functions have several applications particularly in encription algorithms and database indexing.
What in particular do you need to know about hashing?