But the solution to that problem (using a cryptographic hash function randomized... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

marshray on Oct 2, 2012 | parent | context | favorite | on: Myths about Hash Tables

But the solution to that problem (using a cryptographic hash function randomized with a secret) doesn't change the complexity of the algorithm.

rm999 on Oct 2, 2012 [–]

I'm just pointing out that the worst case time complexity is an issue that can't always be cast aside. Aren't cryptographic hash functions generally slower?

Consider applying for YC's Fall 2026 batch! Applications are open till July 27.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact