English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

i am interested in uniquely identifying files using hash functions and i would like to use that hash function which produces hashes that have minimum collisions and thus are most reliable in terms of uniquely identifying very large number of files

2006-12-08 10:50:48 · 3 answers · asked by Rishabh Singla 2 in Computers & Internet Programming & Design

3 answers

SHA1 collision rate is roughly 2^80, CRC64 is roughly 2^63 (not sure about CRC32), and MD5 is 2^64.

2006-12-08 11:12:44 · answer #1 · answered by Anonymous · 0 0

As Lyra mentioned, sure we do, LOL! I even have felt some thing draw closer over an prolonged volume of time now. Now I even have started to experience an urgency, a could be nonetheless, Be alert, Be watchful. I not basically see differences, types, & complicated strains converge with out, yet I experience differences interior of additionally which at the instant are not genuinely shared. Many reward!

2016-10-18 00:11:48 · answer #2 · answered by chowning 4 · 0 0

SHA1 creates a longer key. Therefore, it's less likely to generate the same key.

2006-12-08 12:30:33 · answer #3 · answered by Anonymous · 0 0

fedest.com, questions and answers