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.
Is there any efficiency analysis of how MD5 dependent on the file size. Is it actually dependent of file size or content of the file. So for i have 500mb file with all blank spaces and a 500mb file with movie in it, would md5 take same time to generate the the hash code?
Any hashsum is, by definition, a mathematical sum of the bytes of what you’re summing. You have to read the file through a stream at the very least – more bytes take longer to traverse. However, I’d say (generally speaking) the bottleneck will indeed be reading the file, no matter what you’re trying to with it – not hashing it once you’ve read it.
Edit: I kinda misread the question. It will take exactly the same amount of time to hash two files of equal size. 500mb of spaces is 500mb of bytes which represent “space”. That’s still 8 bits of data per byte, same as any other file.