N-Hash [SEP] based on
N-Hash
In cryptography, N-Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al.; weaknesses were published the following year.
N-Hash has a 128-bit hash size. A message is divided into 128-bit blocks, and each block is combined with the hash value computed so far using the "g" compression function. "g" contains eight rounds, each of which uses an "F" function
hash function, h(x). The hash function will be decided by setting s to k and randomly going through functions until there are no collisions. This can be done in constant time.
FKS Hashing Performance.
Because there are formula_1 pairs of elements, of which have a probability of collision equal to 1/n, FKS hashing can expect to have strictly less than n/2 collisions. Based on this fact and that each h(x) was selected so that the number of collisions would be at most n/2, the size of