Broken MACS, Hashes HW

Either design one yourself or do some this question

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: abytes. You and (e), be carefulclever, space-efficient memory: aEither design a separate source some for CSELabs (d) needmachine. Your to use toosubmission should include onealgorithm or do use a few gigabytes. such research forYou need to use more clever, space-efficient algorithm. Either design one yourself, or do some this question) an algorithm.) research for such an algorithm.) (e) [Extra credit: 10 points] Find a (free) collision in h|k : two distinct messages m1 , m2 such that h|k (m1 ) = h|k (m2 ). For verification purposes, use your student ID as the initial hash value and provide the following values: the colliding hash (h4 in the figure), and its preimages in the tail and the cycle (h3 and h100 in figure (b), respectively). For k > 80 this is worth 10 points, 72 < k ≤ 80 is worth 8 points, 64 < k ≤ 72 is worth 6 points, 56 < k ≤ 64 is worth 4 points, and 32 < k ≤ 56 is worth 2 points. Your main submission should include the collision values, a brief description of your algorithm, and how to compile/run your source code on a CSELabs Linux machine. Your moodle submission should include a separate source file for this question. (Note: for (d) and (e), be careful not to use too much memory: a straightforward algorithm could use several terabytes for large enough k . You need to use a more clever, space-efficient algorithm. Either design one yourself, or do some research for such an algorithm.) 3...
View Full Document

This document was uploaded on 04/03/2014.

Ask a homework question - tutors are online