Linked Questions

Ask Question
24 questions linked to/from Which hashing algorithm is best for uniqueness and speed?
Hot Newest Score Active Unanswered
5 votes
2 answers
12k views

I am going to be developing a program that detects duplicate files and I was wondering what the best/fastest method would be to do this? I am more interested in what the best hash algorithm would be ...
SameOldNick's user avatar
  • 304
3 votes
1 answer
7k views

Possible Duplicate: Which hashing algorithm is best for uniqueness and speed? I have created a hash algorithm and would like to test if it is usable. What do I need to test and how?
SteeveDroz's user avatar
  • 675
-1 votes
1 answer
499 views

At many places, I read that we can use HashMap here for O(1) search. Actually, I want to ask how I can implement easy hashmaps which can satisfy this property. Can anyone tell few hashmaps including ...
hellodear's user avatar
  • 99
5 votes
0 answers
304 views

Forgive me if this is a noob question - My CS education is a somewhat incomplete Basically, I need a way to hash an input, so that someone seeing the output doesn't see the original input value. ...
Eric S.'s user avatar
  • 207
29 votes
9 answers
25k views

I'm doing some data transmission from a dsPIC to a PC and I'm doing an 8-bit CRC to every block of 512 bytes to make sure there are no errors. With my CRC code enabled I get about 33KB/s, without it I ...
FigBug's user avatar
  • 2,379
19 votes
6 answers
5k views

After reading this interesting question, I felt like I had a good idea of which insecure hashing algorithm I'd use if I needed one, but no idea why I might use a secure algorithm instead. So what is ...
CodexArcanum's user avatar
  • 3,461
3 votes
11 answers
7k views

I'm a student of computer science trying to soak up as much information on the topic as I can during my free time. I keep returning to algorithms time and again in various formats (online course, book,...
Jessica's user avatar
  • 111
9 votes
3 answers
17k views

The Austrian electronic ID card relies on the so-called sector identifiers. For example a hospital gets to identify a person by getting a sectorId for that person, which is computed roughly as follows:...
Bozho's user avatar
  • 2,795
2 votes
3 answers
2k views

Related to the question Which hashing algorithm is best for uniqueness and speed? Is there a way to create a hash function, or find one, whose hash length depends completely on the input length, has ...
iordanis's user avatar
  • 163
5 votes
1 answer
2k views

I'm curious if anyone here has any idea how the images were generated as shown in this response: Which hashing algorithm is best for uniqueness and speed? Ian posted a very well-received response but ...
clstroud's user avatar
  • 53
1 vote
3 answers
2k views

I have a MySQL database with a column Body MEDIUMTEXT. Until now I used to only store the contents into it. There was no update option for the users of the application. Now, I wanted to add an update ...
SkrewEverything's user avatar
  • 119
1 vote
2 answers
2k views

I have k csv files (5 csv files for example), each file has m fields which produce a key and n values. I need to produce a single csv file with aggregated data. I'm looking for the most efficient ...
royB's user avatar
  • 217
-1 votes
2 answers
2k views

FNV-1, Murmur2, and DJB2 are examples of non-cryptographic hashing functions used in actual applications (see Which hashing algorithm is best for uniqueness and speed?). These are all similar in that ...
David Spector's user avatar
  • 139
0 votes
3 answers
521 views

I've got a route that contains objects. Each one has value 0 or 1. I need unique route ID which will identify any objects order. Currently I'm doing it using binary number that is converted to decimal ...
Djent's user avatar
  • 101
-3 votes
2 answers
1k views

I'm searching an existing hash function or trying to make a hash function that has a lot of collisions. Regularly a hash is used for it's ability to create unique hashes for hash tables or security ...
NS - Not the train's user avatar
  • 101

15 30 50 per page
1
2