< Previous by Date | Date Index | Next by Date > |
< Previous in Thread | Thread Index | Next in Thread > |
Hrm. Just some preliminary fiddling with the probabilities (alas, my installation of octave is hosed) makes it look _extremely_ likely that you would get repeats within a data set of 2 million (before the hash, we aren't talking about hash collisions here). Just throwing in a timestamp or a counter would make the pre-hash token effectively unique, or you could go with a longer string of random hex (16 should bring it down to a vanishingly small probability). Maybe we could have Helper::computeCallId() take an optional int parameter that would specify the length of random hex the caller wants to go in the hash? Best regards, Byron Campen Has anyone had issue with the true uniqueness of Helper::computeCallID(). |
Attachment:
smime.p7s
Description: S/MIME cryptographic signature