Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to generate md5 hash for ~40 millions strings with salt (~20 symbols),
md5 (string + salt)
check for collisions then save them into bd.
Then when salt is changed i need to generate new hashes with new salt, check for collisions AND check for collisions with old hashes.
Is there some libs to help me here?
Maybe bloom filter could help? Can i use HashMap to check for collisions?
I suggest to insert the generated md5 hashes in a database, and check every iteration of the loop. You can create an index in “hash value” column in order to do quicker searchs.
The table is going to be very big, you can also divide the hashes in several tables (or even databases), with different first character, or first group of characters (hashes_aa, hashes_ab, etc.).
Are you changing the salt so often that this solution doesn’t work for you?
Edit: collisions will be very, very rare, could you just skip the check?