Injective hash function

A hash function is any function that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. Hashes are normally integers. Hash functions accelerate table or database lookup, minimize storage and transmission bandwidth. A hash function that is injective —that is, maps each valid input to a different hash value—is said to be perfect. Following are advantages of hashes: extremely fast searches or look up deter eavesdropping on the data being transmitted deterministic data size (hashes) versus dynamic data sizes (byte streams) secure storage and transmission very fast encoded compared to cryptographic (hash) functions Following are scenarios in which an injective hash function performs the best: Logon credentials such as username and password, which vary in data size, can be combined then hashed. The hash when transmitted on the wire will deter eavesdropping. Dynami...