Solved

Propability of collissions using checksums.

Posted on 2004-11-11
222 Views
Last Modified: 2010-04-17
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
Question by:holli
2 Comments

LVL 33

Expert Comment

0

LVL 55

Accepted Solution

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

Join & Write a Comment Already a member? Login.

INTRODUCTION We all know how to code. But at times you simply want to insert a common code block into your existing code and amend it as per your requirements. This tool not only saves you time but also saves you the pain of typing it all out aga…
If you’re thinking to yourself “That description sounds a lot like two people doing the work that one could accomplish,” you’re not alone.
In this fifth video of the Xpdf series, we discuss and demonstrate the PDFdetach utility, which is able to list and, more importantly, extract attachments that are embedded in PDF files. It does this via a command line interface, making it suitable …
In this seventh video of the Xpdf series, we discuss and demonstrate the PDFfonts utility, which lists all the fonts used in a PDF file. It does this via a command line interface, making it suitable for use in programs, scripts, batch files — any pl…

745 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Need Help in Real-Time?

Connect with top rated Experts

14 Experts available now in Live!