Comments for In Praise of Randomness http://axelexic.org/blog In Defense of Pseudorandomness Tue, 13 Sep 2011 14:33:22 +0000 hourly 1 http://wordpress.org/?v=3.3.1 Comment on Anonymity and Hash Functions by Yogesh Swami http://axelexic.org/blog/2011/09/12/anonymity-and-hash-functions/#comment-3 Yogesh Swami Tue, 13 Sep 2011 14:33:22 +0000 http://axelexic.org/blog/?p=92#comment-3 I think salts will also work fine, but they will probably have to be kept secret from the anonymized data. I think the same is true for n-times hash as long as n is not known to the attacker. Personally, I prefer explicit secrets as in HMAC over implicit one, as its easier to analyze. I think salts will also work fine, but they will probably have to be kept secret from the anonymized data. I think the same is true for n-times hash as long as n is not known to the attacker. Personally, I prefer explicit secrets as in HMAC over implicit one, as its easier to analyze.

]]> Comment on Anonymity and Hash Functions by Paul http://axelexic.org/blog/2011/09/12/anonymity-and-hash-functions/#comment-2 Paul Tue, 13 Sep 2011 07:38:58 +0000 http://axelexic.org/blog/?p=92#comment-2 You raise an interesting question here. What about using a salt when hashing? What about running the hash algorithm n times? You raise an interesting question here.

What about using a salt when hashing?
What about running the hash algorithm n times?

]]>