• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 272
  • Last Modified:

Propability of collissions using checksums.

hi there,

currently i am using a checksum from a file (sha-algorithm) combined with the size of that file as a key in a database.
my question is:
how save is this?
how can i calculate the propability that two files (of the same size) will have the same checksum?

thanks,
holli
0
holli
Asked:
holli
1 Solution
 
Jaime OlivaresCommented:
You can have 2 ^  n (2 to the nth power) where n is number of bits of your hashing/cypher algorithm.

In this case n=160 for SHA algorithm, so probability is near to impossible.

2^160 is aproximately 15000000000000000000000000000000000000000000000000 posible combinations.
0

Featured Post

VIDEO: THE CONCERTO CLOUD FOR HEALTHCARE

Modern healthcare requires a modern cloud. View this brief video to understand how the Concerto Cloud for Healthcare can help your organization.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now