Skip to main content
Theoretical Computer Science

Return to Answer

replaced http://stackoverflow.com/ with https://stackoverflow.com/
Source Link
Community Bot
Community Bot
  • 1

Yes, a hash table or a hash map requires a one-way function. Also duplicate detection (see thisthis and thisthis) can be done very efficiently using one-way functions. Both cases require "good" (with low chances of collision) one-way functions while cryptographic strength is usually not requiredcryptographic strength is usually not required.

Yes, a hash table or a hash map requires a one-way function. Also duplicate detection (see this and this) can be done very efficiently using one-way functions. Both cases require "good" (with low chances of collision) one-way functions while cryptographic strength is usually not required.

Yes, a hash table or a hash map requires a one-way function. Also duplicate detection (see this and this) can be done very efficiently using one-way functions. Both cases require "good" (with low chances of collision) one-way functions while cryptographic strength is usually not required.

Source Link
sharptooth
sharptooth
  • 239
  • 1
  • 5

Yes, a hash table or a hash map requires a one-way function. Also duplicate detection (see this and this) can be done very efficiently using one-way functions. Both cases require "good" (with low chances of collision) one-way functions while cryptographic strength is usually not required.