I am looking for a hash function with the following properties
- It maps an arbitrary string uniformly between 0 and 1
- The hash function output is independent of the length of the string
- The hash function accepts a random seed
- For a given random seed the mapping from string to (0,1) is deterministic meaning if Alice and Bob calculate the hash for a given string and random seed they will both get the same value
- I am not worried about security. I don’t care if someone in theory could reconstruct the set of strings given random seed and hash value
Would be great to get some ideas.
Aucun commentaire:
Enregistrer un commentaire