

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Digital Forensics; Subject: Computer Science; University: University of Illinois - Urbana-Champaign; Term: Fall 2006;
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Due October 13, 2006.
and another that Bob is not willing to sign. She needs to generate a version of each that has the same DES-MAC crypto hash. Suggest how she might do this. Hint: adding white space and combinations of characters with back spaces do not change the meaning of the contracts. Using DES-MAC with 64 bits, there are 2^64 possible hashes. Just using the pigeon hole principle, you are very likely to find a match for a particular hash after trying 2^64 different messages. But in this case, you can vary both the original contract M1 and your goal contract M2. In this case, you have the birthday paradox. You are not trying to match a particular hash value, rather given two groups, you want to find one member in each group that matches each other. If you compute hashes of 2^32 versions of M1 and 232 versions of M2, then you have a probability of around ½ that you have a match between the variants of M1 and the variants of m2.